从编译程序中符号表的总体组织和表项属性信息组织来看,符号表是一种算法复杂性很高的数据结构,而且也不利于用户与图形界面的交互。
Symbol table is data structure which has high arithmetic complexity from whole structure and items' attribute information, and it is inconvenient for users to interact with graphic interface.
我们称为维护问题,并提出恒定时问维护的概念,即维护问题算法的时间复杂性与数据库大小无关。
We propose a notion of constant time maintenance, according to which the maintenance algorithm runs in time independent of the size of the database state.
与相干检测的天线选择相比,NON - AS算法不需要估计信道,大大降低了系统复杂性。
Compared with coherent antenna selection, the NON-AS algorithm do not require estimating channel state information, which greatly reduce system complexity.
应用推荐