Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"3SAT"”.
-
Imperfect gaps in Gap-ETH and PCPs
… approximating perfectly satisfiable instances of 3SAT versus those with imperfect completeness. We show that the Gap-ETH conjecture without perfect completeness is equivalent to Gap-ETH with perfect completeness; that is, MAX 3SAT(1 - [epsilon], 1 - [delta]) for [delta] > [epsilon] has …
-
Case studies in quantum adiabatic optimization
… can occur. We present I A random ensemble of 3SAT instances which this algorithm does not solve efficiently. For these instances H(s) has a small eigenvalue gap at a value s* which approaches 1 as n - oc. II Theorems concerning the interpolating Hamiltonian when Hp is "scrambled" by …
-
Quantum free games
… classes. 1. We show a BellQMA(2) protocol for 3SAT on n variables, where the total amount of communication is Õ(√n). This answers an open question of Chen and Drucker [CD10] and also shows, conditional on ETH, that the algorithm of Brandao, Christandl and Yard [BCY10] for optimizing ˜ over …
-
Graphical structure of unsatisfiable boolean formulae
The presented research is an introduction and analysis of a novel graph decision problem called GraphSAT. Using the tools of topology and graph theory, this new variant builds upon the classical logic and computer science problem of boolean satisfiability k-SAT. k-SAT asks if there exists a truth …