Related references
Note: Only part of the references are listed.Quantum Computing in the NISQ era and beyond
John Preskill
QUANTUM (2018)
Trading Classical and Quantum Computational Resources
Sergey Bravyi et al.
PHYSICAL REVIEW X (2016)
3-SAT FASTER AND SIMPLER-UNIQUE-SAT BOUNDS FOR PPSZ HOLD IN GENERAL
Timon Hertli
SIAM JOURNAL ON COMPUTING (2014)
An improved exponential-time algorithm for k-SAT
R Paturi et al.
JOURNAL OF THE ACM (2005)
A deterministic (2-2/(k+1))n algorithm for k-SAT based on local search
E Dantsin et al.
THEORETICAL COMPUTER SCIENCE (2002)
Share Paper
