Abstract
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(n3/2/logn).
- N. Alon and U. Zwick. 1989. On Nečiporuk’s theorem for branching programs. Theor. Comput. Sci. 64, 3 (1989), 331--342. Google Scholar
Digital Library
- R. B. Boppana and M. Sipser. 1990. The complexity of finite functions. In Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.). Vol. A. Elsevier, 757--804. Google Scholar
Cross Ref
- A. Cobham. 1966. The recognition problem for the set of perfect squares. In 7th Annual Symposium on Switching and Automata Theory, 1966. 78--87. DOI:http://dx.doi.org/10.1109/SWAT.1966.30 Google Scholar
Digital Library
- J. Goldsmith, M. A. Levy, and M. Mundhenk. 1996. Limited nondeterminism. SIGACT News 27, 2 (1996), 20--29. DOI:http://dx.doi.org/10.1145/235767.235769 Google Scholar
Digital Library
- J. Håstad. 1998. The shrinkage exponent of de Morgan formulas is 2. SIAM J. Comput. 27, 1 (1998), 48--64. DOI:http://dx.doi.org/10.1137/S0097539794261556 Google Scholar
Digital Library
- J. Hromkovic and G. Schnitger. 2003. Nondeterministic communication with a limited number of advice bits. SIAM J. Comput. 33, 1 (2003), 43--68. Google Scholar
Digital Library
- S. Jukna. 2001. Extremal Combinatorics—With Applications in Computer Science. Springer. Google Scholar
Cross Ref
- S. Jukna. 2012. Boolean Function Complexity: Advances and Frontiers. Vol. 27. Springer. Google Scholar
Cross Ref
- M. Karchmer and A. Wigderson. 1993. On span programs. In Proceedings of the 8th Structure in Complexity Theory. IEEE Computer Society Press, 102--111. Google Scholar
Cross Ref
- H. Klauck. 2007. One-way communication complexity and the Nečiporuk lower bound on formula size. SIAM J. Comput. 37, 2 (2007), 552--583. Google Scholar
Digital Library
- O. B. Lupanov. 1958. A method of circuit synthesis. Izv. V.U.Z. Radiofiz. 1 (1958), 120--140.Google Scholar
- O. B. Lupanov. 1960. On the complexity of the realization of the functions of an algebra of logic by formulas. Problemy Kibernet. Vyp 3 (1960), 61--80.Google Scholar
- W. Masek. 1976. A Fast Algorithm for String Editing Problem and Decision Graph Complexity. Technical Report. Massachussetts Institute of Technology.Google Scholar
- È. Nečiporuk. 1962. On the complexity of schemes in some bases containing nontrivial elements with zero weights. Probl. Kibernet. 8 (1962), 123--160 (in Russian).Google Scholar
- È. Nečiporuk. 1966. On a boolean function. Dokl. Acad. USSR 169, 4 (1966), 765--766. Translation: Sov. Math. Dokl. 7, 4 (1966), 999--1000.Google Scholar
- W. Paul. 1978. Komplexitätstheorie. Teubner Studienbücher.Google Scholar
- P. Pudlák. 1987. The hierarchy of boolean circuits. Comput. Artif. Intell. 6, 5 (1987), 449--468.Google Scholar
Digital Library
- A. Razborov. 1991. Lower bounds for deterministic and nondeterministic branching programs. In Proceedings of the 8th International Symposium on Fundamentals of Computation Theory. 47--60. Google Scholar
Cross Ref
- J. E. Savage. 1976. The Complexity of Computing. John Wiley, New York.Google Scholar
- I. Wegener. 1987. The Complexity of Boolean Functions. B. G. Teubner 8 John Wiley, Stuttgart.Google Scholar
- I. Wegener. 2000. Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM, Philadelphia. Google Scholar
Cross Ref
Index Terms
Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method
Recommendations
Lower bound for converting an NFA with finite nondeterminism into an MDFA
It is known that a nondeterministic finite automaton (NFA) with n states and branching k can be simulated by a deterministic finite automaton with multiple initial states (MDFA) having k ċ n states (M. Kappes, J. Automata, Languages and Combinatorics 5, ...
One-Way Communication Complexity and the Nečiporuk Lower Bound on Formula Size
In this paper the Nečiporuk method for proving lower bounds on the size of Boolean formulas is reformulated in terms of one-way communication complexity. We investigate the settings of probabilistic formulas, nondeterministic formulas, and quantum ...
Regulated nondeterminism in pushdown automata
CIAA'07: Proceedings of the 12th international conference on Implementation and application of automataA generalization of pushdown automata towards regulated nondeterminism is studied. The nondeterminism is governed in such a way that the decision, whether or not a nondeterministic rule is applied, depends on the whole content of the stack. More ...






Comments