The Hardest Explicit Construction

06/02/2021
by   Oliver Korten, et al.
0

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size n possessing some pseudorandom property in time polynomial in n. We give overwhelming evidence that APEPP, defined originally by Kleinberg et al., is the natural complexity class associated with explicit constructions of objects whose existence follows from the probabilistic method, by placing a variety of such construction problems in this class. We then demonstrate that a result of Jeřábek on provability in Bounded Arithmetic, when reinterpreted as a reduction between search problems, shows that constructing a truth table of high circuit complexity is complete for APEPP under P^NP reductions. This illustrates that Shannon's classical proof of the existence of hard boolean functions is in fact a universal probabilistic existence argument: derandomizing his proof implies a generic derandomization of the probabilistic method. As a corollary, we prove that EXP^NP contains a language of circuit complexity 2^n^Ω(1) if and only if it contains a language of circuit complexity 2^n/2n. Finally, for several of the problems shown to lie in APEPP, we demonstrate direct polynomial time reductions to the explicit construction of hard truth tables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/10/2020

Relativization of Gurevich's Conjectures

Gurevich (1988) conjectured that there is no logic for P or for NP∩coNP....
research
01/17/2018

Nonuniform Reductions and NP-Completeness

Nonuniformity is a central concept in computational complexity with powe...
research
12/22/2022

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

The complexity class NP of decision problems that can be solved nondeter...
research
08/22/2019

On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials

We study the arithmetic circuit complexity of some well-known family of ...
research
05/19/2020

Proving P!=NP in first-order PA

We show that it is provable in PA that there is an arithmetically defina...
research
11/06/2017

Computational Flows in Arithmetic

A computational flow is a pair consisting of a sequence of computational...
research
03/02/2020

Hardness of Sparse Sets and Minimal Circuit Size Problem

We develop a polynomial method on finite fields to amplify the hardness ...

Please sign up or login with your details

Forgot password? Click here to reset