Name
Abstract | ||
|---|---|---|
Adversarial satisfiability (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a Boolean formula true (resp. false) by controlling their respective sets of variables. AdSAT belongs to a higher complexity class in the polynomial hierarchy than SAT, and therefore the nature of the critical region and the transition are not easily parallel to those of SAT and worthy of independent study. AdSAT also provides an upper bound for the transition threshold of the quantum satisfiability problem (QSAT). We present a complete algorithm for AdSAT, show that 2-AdSAT is in P, and then study two stochastic algorithms (simulated annealing and its improved variant) and compare their performances in detail for 3-AdSAT. Varying the density of clauses a we claim that there is a sharp SAT-UNSAT transition at a critical value whose upper bound is alpha(c) less than or similar to 1.5, suggesting a much stricter upper bound for the QSAT transition than those previously found. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1103/PhysRevE.89.032128 | PHYSICAL REVIEW E |
Field | DocType | Volume |
Complexity class,Simulated annealing,Polynomial hierarchy,Discrete mathematics,Combinatorics,Upper and lower bounds,Satisfiability,Boolean satisfiability problem,True quantified Boolean formula,Mathematics,Computational complexity theory | Journal | 89 |
Issue | ISSN | Citations |
3 | 1539-3755 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Bardoscia | 1 | 2 | 0.86 |
| Daniel Nagaj | 2 | 57 | 5.84 |
| A. Scardicchio | 3 | 15 | 2.46 |