Advertisement

No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth

  • Igor RazgonEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8894)

Abstract

In this paper, given a parameter \(k\), we demonstrate an infinite class of cnfs of treewidth at most \(k\) of their primal graphs such that equivalent nondeterministic read-once branching programs (nrobps) are of size at least \(n^{ck}\) for some universal constant \(c\). Thus we rule out the possibility of fixed-parameter tractable space complexity of nrobps parameterized by the smallest treewidth of equivalent cnfs.

Keywords

Boolean Function Space Complexity Induction Assumption Tree Decomposition Truth Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Notes

Acknowledgments

I would like to thank anonymous reviewers for very useful and insightful comments. The research has been partly supported by the EPSRC grant EP/L020408/1.

References

  1. 1.
    Borodin, A., Razborov, A.A., Smolensky, R.: On lower bounds for read-k-times branching programs. Comput. Complex 3, 1–18 (1993)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bryant, R.E.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293–318 (1992)CrossRefGoogle Scholar
  3. 3.
    Ferrara, A., Pan, G., Vardi, M.Y.: Treewidth in verification: Local vs. global. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 489–503. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  4. 4.
    Jukna, S.: Boolean Function Complexity: Advances and Frontiers. Springer, Berlin (2012)CrossRefGoogle Scholar
  5. 5.
    Razborov, A.: Lower bounds for deterministic and nondeterministic branching programs. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 199, pp. 47–60. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  6. 6.
    Razborov, A., Wigderson, A., Chi-Chih Yao, A.: Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus. In: STOC, pp. 739–748 (1997)Google Scholar
  7. 7.
    Razgon, I.: No small nondeterministic read-once branching programs for CNFs of bounded treewidth. CoRR, abs/1407.0491 (2014)Google Scholar
  8. 8.
    Razgon, I.: On OBDDs for CNFs of bounded treewidth. In: KR, pp. 92–100 (2014)Google Scholar
  9. 9.
    Vatshelle, M.: New width parameters of graphs. Ph.D. Thesis, Department of Informatics, University of Bergen 2012Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computer Science and Information SystemsBirkbeck, University of LondonLondonUK

Personalised recommendations