no code implementations • 28 Jan 2000 • Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Michael Sipser
We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.
Quantum Physics
