There are fixed positive rational ε and δ and a deterministic reduction mapping an End-of-Line instance of binary length N to a generalized circuit of length N(log N)^O(1).
There are fixed positive rational ε and δ and a deterministic reduction mapping an End-of-Line instance of binary length N to a generalized circuit of length N(log N)^O(1). A solution to the original instance can be recovered in polynomial time from any polynomial-length rational assignment ε-satisfying all but a δ fraction of gates.
There are fixed positive rational ε and δ and a deterministic reduction mapping an End-of-Line instance of binary length N to a generalized circuit of length N(log N)^O(1). A solution to the original instance can be recovered in polynomial time from any polynomial-length rational assignment ε-satisfying all but a δ fraction of gates.
If correct, resolves the quasilinear-size PCP-for-PPAD conjecture of Babichenko, Papadimitriou, and Rubinstein.
Can PPAD hardness survive a fixed fraction of erroneous generalized-circuit gates with quasilinear reduction size?
Publication dates and editorial changes.
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
