Nečiporuk下界方法的非确定性和抽象形式
Nondeterminism and an abstract formulation of Nečiporuk's lower bound method
摘要:
一个配方的“Nečiporuk的下限方法”稍微更具包容性比通常的复杂性措施的具体配方。使用这个一般的配方,限制的下限可实现的方法获得几个计算模型,如分支程序和布尔公式具有访问一个次线性数量的不确定性位。特别是,它示出的任何下限可实现的方法Nečiporuk的大小的不确定性和奇偶分支程序是最多$O(n^{3/2}/\log n)$。
英文摘要:
A formulation of "Nečiporuk's lower bound method" slightly more inclusive than the usual complexity-measure-specific formulation is presented. Using this general formulation, limitations to lower bounds achievable by the method are obtained for several computation models, such as branching programs and Boolean formulas having access to a sublinear number of nondeterministic bits. In particular, it is shown that any lower bound achievable by the method of Nečiporuk for the size of nondeterministic and parity branching programs is at most $O(n^{3/2}/\log n)$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。