Dean Kelley
Abstract
Sign rank vs Discrepancy, Hamed Hatami, Kaave Hosseini, Shachar Lovett, TR19-067. LARGE CLIQUE IS HARD ON AVERAGE FOR RESOLUTION, Shuo Pang, TR19-068. Bounded-depth Frege complexity of Tseitin formulas for all graphs, Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, TR19-069.
Recommendations
Technical Report Column
Complexity Theory, Game Theory, and Economics, Tim Roughgarden, TR18-001. Which Distribution Distances are Sublinearly Testable?, Constantinos Daskalakis, Gautam Kamath, John Wright, TR18-002. Proving that prBPP = prP is as hard as \almost" proving that ...
Column: Team Diagonalization
Ten years ago, Gla'er, Pavan, Selman, and Zhang [GPSZ08] proved that if P 6= NP, then all NP-complete sets can be simply split into two NP-complete sets. That advance might naturally make one wonder about a quite di erent potential consequence of NP-...
Open Problems Column
There have been two polls asking theorists (and others) what they thought of P vs NP and related questions [5, 6]. Both were written by me (William Gasarch) and appeared in the Complexity Column of SIGACT News, edited by Lane A. Hemaspaandra.
I have ...
Comments