Promise Problems Meet Pseudodeterminism

The Acceptance Probability Estimation Problem (APEP) is to additively approximate the acceptance probability of a Boolean circuit. This problem admits a probabilistic approximation scheme. A central question is whether we can design a pseudodeterministic approximation algorithm for this problem: a probabilistic polynomial-time algorithm that outputs a canonical approximation with high probability. Recently, it was shown that such an algorithm would imply that every approximation algorithm can be made pseudodeterministic (Dixon, Pavan, Vinodchandran; ITCS 2021). The main conceptual contribution of this work is to establish that the existence of a pseudodeterministic algorithm for APEP is fundamentally connected to the relationship between probabilistic promise classes and the corresponding standard complexity classes. In particular, we show the following equivalence: every promise problem in PromiseBPP has a solution in BPP if and only if APEP has a pseudodeterministic algorithm. Based on this intuition, we show that pseudodeterministic algorithms for APEP can shed light on a few central topics in complexity theory such as circuit lowerbounds, probabilistic hierarchy theorems, and multi-pseudodeterminism.

[1]  Ofer Grossman,et al.  Reproducibility and Pseudo-Determinism in Log-Space , 2018, Electron. Colloquium Comput. Complex..

[2]  Shafi Goldwasser,et al.  Bipartite Perfect Matching in Pseudo-Deterministic NC , 2017, ICALP.

[3]  N. V. Vinodchandran,et al.  On Pseudodeterministic Approximation Algorithms , 2018, MFCS.

[4]  Dana Ron,et al.  On the possibilities and limitations of pseudodeterministic algorithms , 2013, ITCS '13.

[5]  Rahul Santhanam.  Circuit lower bounds for Merlin-Arthur classes , 2007, STOC '07.

[6]  Dieter van Melkebeek,et al.  A generic time hierarchy for semantic models with one bit of advice , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

[7]  Ravi Kannan,et al.  Circuit-Size Lower Bounds and Non-Reducibility to Sparse Sets , 1982, Inf. Control..

[8]  Dhiraj Holden.  A Note on Unconditional Subexponential-time Pseudo-deterministic Algorithms for BPP Search Problems , 2017, ArXiv.

[9]  N. V. Vinodchandran.  A note on the circuit complexity of PP , 2005, Theor. Comput. Sci..

[10]  Stanislav Zák,et al.  A Turing Machine Time Hierarchy , 1983, Theor. Comput. Sci..

[11]  Oded Goldreich.  Multi-pseudodeterministic algorithms , 2019, Electron. Colloquium Comput. Complex..

[12]  Avi Wigderson,et al.  In search of an easy witness: exponential time vs. probabilistic polynomial time , 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

[13]  Stephen A. Cook,et al.  A hierarchy for nondeterministic time complexity , 1972, J. Comput. Syst. Sci..

[14]  Shafi Goldwasser,et al.  Pseudo-deterministic Proofs , 2017, Electron. Colloquium Comput. Complex..

[15]  Rahul Santhanam,et al.  Pseudodeterministic algorithms and the structure of probabilistic time , 2021, Empir. Softw. Eng..

[16]  A CookStephen.  A hierarchy for nondeterministic time complexity , 1973 .

[17]  Boaz Barak,et al.  A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms , 2002, RANDOM.

[18]  Oded Goldreich,et al.  Another proof that bpp?ph (and more) , 1997 .

[19]  Vijay V. Vazirani,et al.  Matching Is as Easy as the Decision Problem, in the NC Model , 2019, ITCS.

[20]  Shafi Goldwasser,et al.  Probabilistic Search Algorithms with Unique Answers and Their Cryptographic Applications , 2011, Electron. Colloquium Comput. Complex..

[21]  Oded Goldreich,et al.  In a World of P=BPP , 2010, Studies in Complexity and Cryptography.

[22]  Igor Carboni Oliveira,et al.  Pseudodeterministic constructions in subexponential time , 2016, STOC.

[23]  Luca Trevisan,et al.  Hierarchies for semantic classes , 2005, STOC '05.

[24]  Shafi Goldwasser,et al.  Doubly-Efficient Pseudo-Deterministic Proofs , 2019, Electron. Colloquium Comput. Complex..

[25]  SahaiAmit,et al.  A complete problem for statistical zero knowledge , 2003 .

[26]  Michael J. Fischer,et al.  Separating Nondeterministic Time Complexity Classes , 1978, JACM.

[27]  Jin-Yi Cai.  S p 2 ⊆ ZPP NP , 2007 .

[28]  Sampath Kannan,et al.  Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..

[29]  J. Köbler,et al.  New Collapse Consequences of NP Having Small Circuits , 1999, SIAM J. Comput..

[30]  Igor Carboni Oliveira,et al.  Pseudo-derandomizing learning and approximation , 2018, Electron. Colloquium Comput. Complex..

[31]  Richard Edwin Stearns,et al.  Hierarchies of memory limited computations , 1965, SWCT.

[32]  Lance Fortnow,et al.  Hierarchy theorems for probabilistic polynomial time , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[33]  Richard Edwin Stearns,et al.  Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.

[34]  Oded Goldreich,et al.  On Promise Problems: A Survey , 2006, Essays in Memory of Shimon Even.

[35]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[36]  N. V. Vinodchandran,et al.  Complete Problems for Multi-Pseudodeterministic Computations , 2021, ITCS.

[37]  Ofer Grossman.  Finding Primitive Roots Pseudo-Deterministically , 2015, Electron. Colloquium Comput. Complex..