no code implementations • 15 Feb 2021 • Peter Bürgisser, M. Levent Doğan, Visu Makam, Michael Walter, Avi Wigderson
We also show how to efficiently find separating invariants for orbits, and how to compute systems of generating rational invariants for these actions (in contrast, for polynomial invariants the latter is known to be hard).
Data Structures and Algorithms Mathematical Physics Algebraic Geometry Mathematical Physics Representation Theory
no code implementations • 9 Feb 2021 • Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson
In a recent (and surprising) result, Dadush and Tiwari showed that these short refutations of the Tseitin formulas could be translated into quasi-polynomial size and depth Cutting Planes proofs, refuting a long-standing conjecture.
Computational Complexity
no code implementations • NeurIPS 2015 • Tengyu Ma, Avi Wigderson
It was also known that this quadratic gap cannot be improved by the the most basic {\em semi-definite} (SDP, aka spectral) relaxation, equivalent to a degree-2 SoS algorithms.
no code implementations • 22 Feb 2015 • Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff
We further construct sample compression schemes of size $k$ for $C$, with additional information of $k \log(k)$ bits.