skip to main content
research-article
Public Access

Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method

Authors Info & Claims
Published:26 December 2016Publication History
Skip Abstract Section

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).

References

  1. N. Alon and U. Zwick. 1989. On Nečiporuk’s theorem for branching programs. Theor. Comput. Sci. 64, 3 (1989), 331--342. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarCross RefCross Ref
  3. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  5. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Hromkovic and G. Schnitger. 2003. Nondeterministic communication with a limited number of advice bits. SIAM J. Comput. 33, 1 (2003), 43--68. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Jukna. 2001. Extremal Combinatorics—With Applications in Computer Science. Springer. Google ScholarGoogle ScholarCross RefCross Ref
  8. S. Jukna. 2012. Boolean Function Complexity: Advances and Frontiers. Vol. 27. Springer. Google ScholarGoogle ScholarCross RefCross Ref
  9. 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 ScholarGoogle ScholarCross RefCross Ref
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. O. B. Lupanov. 1958. A method of circuit synthesis. Izv. V.U.Z. Radiofiz. 1 (1958), 120--140.Google ScholarGoogle Scholar
  12. 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 ScholarGoogle Scholar
  13. W. Masek. 1976. A Fast Algorithm for String Editing Problem and Decision Graph Complexity. Technical Report. Massachussetts Institute of Technology.Google ScholarGoogle Scholar
  14. È. 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 ScholarGoogle Scholar
  15. È. 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 ScholarGoogle Scholar
  16. W. Paul. 1978. Komplexitätstheorie. Teubner Studienbücher.Google ScholarGoogle Scholar
  17. P. Pudlák. 1987. The hierarchy of boolean circuits. Comput. Artif. Intell. 6, 5 (1987), 449--468.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 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 ScholarGoogle ScholarCross RefCross Ref
  19. J. E. Savage. 1976. The Complexity of Computing. John Wiley, New York.Google ScholarGoogle Scholar
  20. I. Wegener. 1987. The Complexity of Boolean Functions. B. G. Teubner 8 John Wiley, Stuttgart.Google ScholarGoogle Scholar
  21. I. Wegener. 2000. Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM, Philadelphia. Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in

    Full Access

    • Published in

      cover image ACM Transactions on Computation Theory
      ACM Transactions on Computation Theory  Volume 9, Issue 1
      March 2017
      118 pages
      ISSN:1942-3454
      EISSN:1942-3462
      DOI:10.1145/3007903
      Issue’s Table of Contents

      Copyright © 2016 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 26 December 2016
      • Accepted: 1 October 2016
      • Revised: 1 September 2016
      • Received: 1 June 2016
      Published in toct Volume 9, Issue 1

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article
      • Research
      • Refereed

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!