One-Tape Turing Machine and Branching Program Lower Bounds for MCSP

For a size parameter s : N → N, the Minimum Circuit Size Problem (denoted by MCSP[s(n)]) is the problem of deciding whether the minimum circuit size of a given function f : {0, 1} → {0, 1} (represented by a string of length N := 2) is at most a threshold s(n). A recent line of work exhibited “hardness magnification” phenomena for MCSP: A very weak lower bound for MCSP implies a breakthrough result in complexity theory. For example, McKay, Murray, and Williams (STOC 2019) implicitly showed that, for some constant μ1 > 0, if MCSP[2μ1·n] cannot be computed by a one-tape Turing machine (with an additional one-way read-only input tape) running in time N1.01, then P 6= NP. In this paper, we present the following new lower bounds against one-tape Turing machines and branching programs: 1. A randomized two-sided error one-tape Turing machine (with an additional one-way read-only input tape) cannot compute MCSP[2μ2·n] in time N1.99, for some constant μ2 > μ1. 2. A non-deterministic (or parity) branching program of size o(N1.5/ logN) cannot compute MKTP, which is a time-bounded Kolmogorov complexity analogue of MCSP. This is shown by directly applying the Nechiporuk method to MKTP, which previously appeared to be difficult. These results are the first non-trivial lower bounds for MCSP and MKTP against one-tape Turing machines and non-deterministic branching programs, and essentially match the best-known lower bounds for any explicit functions against these computational models. The first result is based on recent constructions of pseudorandom generators for read-once oblivious branching programs (ROBPs) and combinatorial rectangles (Forbes and Kelley, FOCS 2018; Viola 2019). En route, we obtain several related results: 1. There exists a (local) hitting set generator with seed length Õ( √ N) secure against read-once polynomial-size non-deterministic branching programs on N -bit inputs. 2. Any read-once co-non-deterministic branching program computing MCSP must have size at least 2Ω̃(N). 2012 ACM Subject Classification Theory of computation → Circuit complexity; Theory of computation → Pseudorandomness and derandomization

[1]  Shuichi Hirahara,et al.  Non-disjoint promise problems from meta-computational view of pseudorandom generator constructions , 2020, CCC.

[2]  Rahul Santhanam,et al.  Beyond Natural Proofs: Hardness Magnification and Locality , 2019, Electron. Colloquium Comput. Complex..

[3]  Lijie Chen,et al.  Hardness Magnification for all Sparse NP Languages , 2019, 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS).

[4]  Avishay Tal,et al.  AC0[p] Lower Bounds against MCSP via the Coin Problem , 2019, Electron. Colloquium Comput. Complex..

[5]  Dylan M. McKay,et al.  Weak lower bounds on resource-bounded compression imply strong separations of complexity classes , 2019, STOC.

[6]  Chin Ho Lee Fourier bounds and pseudorandom generators for product tests , 2019, Electron. Colloquium Comput. Complex..

[7]  Emanuele Viola Pseudorandom bits and lower bounds for randomized Turing machines , 2019, Electron. Colloquium Comput. Complex..

[8]  Mahdi Cheraghchi,et al.  Circuit Lower Bounds for MCSP from Local Pseudorandom Generators , 2020, Electron. Colloquium Comput. Complex..

[9]  Igor Carboni Oliveira,et al.  Hardness magnification near state-of-the-art lower bounds , 2019, Electron. Colloquium Comput. Complex..

[10]  Shuichi Hirahara,et al.  Non-Black-Box Worst-Case to Average-Case Reductions within NP , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[11]  Igor Carboni Oliveira,et al.  Hardness Magnification for Natural Problems , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[12]  Michael A. Forbes,et al.  Pseudorandom Generators for Read-Once Branching Programs, in Any Order , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[13]  Eric Allender,et al.  New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems , 2019, MFCS.

[14]  Rahul Santhanam,et al.  On the Average-Case Complexity of MCSP and Its Variants , 2017, CCC.

[15]  Emanuele Viola,et al.  Bounded independence plus noise fools products , 2016, Electron. Colloquium Comput. Complex..

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

[17]  Russell Impagliazzo,et al.  Learning Algorithms from Natural Proofs , 2016, CCC.

[18]  Osamu Watanabe,et al.  Limits of Minimum Circuit Size Problem as Oracle , 2016, CCC.

[19]  John M. Hitchcock,et al.  On the NP-Completeness of the Minimum Circuit Size Problem , 2015, FSTTCS.

[20]  Cody Murray,et al.  On the (Non) NP-Hardness of Computing Circuit Complexity , 2015, Theory Comput..

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

[22]  Igor S. Sergeev,et al.  Complexity of computation in finite fields , 2013 .

[23]  Russell Impagliazzo,et al.  Pseudorandomness from Shrinkage , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[24]  Eric Allender,et al.  The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory , 2009, J. Comput. Syst. Sci..

[25]  Eric Allender,et al.  Amplifying Lower Bounds by Means of Self-Reducibility , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

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

[27]  Ran Raz,et al.  A time lower bound for satisfiability , 2004, Theor. Comput. Sci..

[28]  Eric Allender,et al.  Power from random strings , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[29]  Oded Goldreich,et al.  Simple Constructions of Almost k -wise Independent Random Variables , 2002 .

[30]  Jin-Yi Cai,et al.  Circuit minimization problem , 2000, STOC '00.

[31]  José D. P. Rolim,et al.  Small Pseudo-Random Sets Yield Hard Functions: New Tight Explict Lower Bounds for Branching Programs , 1999, ICALP.

[32]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[33]  Alexander A. Razborov,et al.  Natural Proofs , 2007 .

[34]  Bala Kalyanasundaram,et al.  Communication Complexity and Lower Bounds for Sequential Computation , 1992, Informatik.

[35]  Moni Naor,et al.  Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.

[36]  Wolfgang Maass,et al.  Speed-Up of Turing Machines with One Work Tape and a Two-Way Input Tape , 1987, SIAM J. Comput..

[37]  Wolfgang Maass,et al.  Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines , 1984, STOC '84.

[38]  Osamu Watanabe The Time-Precision Tradeoff Problem on On-Line Probabilistic Turing Machines , 1983, Theor. Comput. Sci..

[39]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[40]  F. C. Hennie,et al.  One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

[41]  Raymond J. Nelson,et al.  Review: Claude E. Shannon, The Synthesis of Two-Terminal Switching Circuits , 1955 .

[42]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..