Hardness of Function Composition for Semantic Read once Branching Programs

In this work, we study time/space trade-offs for function composition. We prove asymptotically optimal lower bounds for function composition in the setting of nondeterministic read once branching programs, for the syntactic model as well as the stronger semantic model of read-once nondeterministic computation. We prove that such branching programs for solving the tree evaluation problem over an alphabet of size k requires size roughly kω(h), i.e space ω(h log k). Our lower bound nearly matches the natural upper bound which follows the best strategy for black-white pebbling the underlying tree. While previous super-polynomial lower bounds have been proven for read-once nondeterministic branching programs (for both the syntactic as well as the semantic models), we give the first lower bounds for iterated function composition, and in these models our lower bounds are near optimal.

[1]  David Liu,et al.  Pebbling Arguments for Tree Evaluation , 2013, ArXiv.

[2]  Lance Fortnow,et al.  Time-space tradeoffs for nondeterministic computation , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[3]  Dieter van Melkebeek,et al.  Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines , 2006, SIAM J. Comput..

[4]  Avishay Tal,et al.  Shrinkage of De Morgan Formulae by Spectral Techniques , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[5]  Michael E. Saks,et al.  Time-Space Tradeoffs for Branching Programs , 2001, J. Comput. Syst. Sci..

[6]  Pierre McKenzie,et al.  Nondeterminism and An Abstract Formulation of Nečiporuk’s Lower Bound Method , 2016, ACM Trans. Comput. Theory.

[7]  Matthias Homeister,et al.  On lower bounds for parity branching programs , 2003 .

[8]  Stasys Jukna,et al.  A Note on Read-k Times Branching Programs , 1994, RAIRO Theor. Informatics Appl..

[9]  Mark Braverman,et al.  Pebbles and Branching Programs for Tree Evaluation , 2012, TOCT.

[10]  Iannis Tourlakis.  Time-Space Tradeoffs for SAT on Nonuniform Machines , 2001, J. Comput. Syst. Sci..

[11]  Meinel,et al.  Separating the eraser Turing machine classes , 2001 .

[12]  HierarchyRan Raz,et al.  Separation of the Monotone NC , 1999 .

[13]  Mika Göös,et al.  Lower Bounds for Clique vs. Independent Set , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[14]  Miklós Ajtai,et al.  A Non-linear Time Lower Bound for Boolean Branching Programs , 2005, Theory Comput..

[15]  Gábor Lugosi,et al.  Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.

[16]  Allan Borodin,et al.  On lower bounds for read-k-times branching programs , 2005, computational complexity.

[17]  Noah Fleming.  Approximate Constraint Satisfaction Requires Large LP Relaxations , 2018 .

[18]  Stasys Jukna.  The Effect of Null-Chains on the Complexity of Contact Schemes , 1989, FCT.

[19]  Or Meir,et al.  Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, computational complexity.

[20]  Or Meir,et al.  Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture , 2014, STOC.

[21]  Richard J. Lipton,et al.  Time-space lower bounds for satisfiability , 2005, JACM.

[22]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[23]  Christoph Meinel,et al.  Separating the Eraser Turing Machine Classes Le, NLe, co-NLe and Pe , 1988, International Symposium on Mathematical Foundations of Computer Science.

[24]  Michael E. Saks,et al.  Time-space trade-off lower bounds for randomized computation of decision problems , 2003, JACM.

[25]  Lance Fortnow.  Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

[26]  Toniann Pitassi,et al.  Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs , 2016, ICALP.

[27]  Ran Raz,et al.  Separation of the Monotone NC Hierarchy , 1999, Comb..

[28]  Ran Raz,et al.  Super-logarithmic depth lower bounds via the direct sum in communication complexity , 1995, computational complexity.

[29]  Stasys Jukna.  A nondeterministic space-time tradeoff for linear codes , 2009, Inf. Process. Lett..

[30]  Pierre McKenzie,et al.  A Note on Nečiporuk ’ s Method for Nondeterministic Branching Programs , 2011 .

[31]  Marc Vinyals,et al.  How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity) , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[32]  Russell Impagliazzo,et al.  Communication complexity towards lower bounds on circuit depth , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[33]  Stephen A. Cook,et al.  Storage Requirements for Deterministic Polynomial Time Recognizable Languages , 1976, J. Comput. Syst. Sci..