Searching for "On the Unique Satisfiability Problem" – sorted by Relevance.
8 documents found, showing 1 through 8.
-
The Complexity of Generating and Checking Proofs of Membership
- …) complete for P NP[O(log n)] ? 3. Is the unique satisfiability problem (USAT) NP hard? We define a…
- Cited by 7 (3 self) – Add To MetaCart
-
On Unique Satisfiability and the Threshold Behavior of Randomized Reductions
- … reductions in the complexity of the class D P and the Unique Satisfiability problem. We show that the often…
- Cited by 6 (1 self) – Add To MetaCart
-
On unique satisfiability and randomized reductions
- …. As a special case, the unique satisfiability problem is the problem of detecting if a Boolean formula…
- Cited by 1 (0 self) – Add To MetaCart
-
The Complexity of Planar Counting Problems
- … satisfiability problems [L. G. Valiant and V. V. Vazirani, NP is as easy as detecting unique solutions, in Proc…
- Add To MetaCart
-
On the Complexity of Data Disjunctions
- … to the unique satisfiability problem. The uniqueness variant of a problem has often different complexity…
- Cited by 1 (0 self) – Add To MetaCart
-
Complexity of unique list colorability
- … to be decided whether there is a variable assignment x satisfying φ. In the unique satisfiability problem (USAT…
- Cited by 1 (0 self) – Add To MetaCart
-
Counting Hierarchies: Polynomial Time And Constant Depth Circuits
- … probabilistic reductions to the "unique satisfiability problem".) 8. \Phi \Delta \Phi\Delta C = \Phi\Delta C. 9…
- Cited by 11 (4 self) – Add To MetaCart
-
Regularity Of Minimizing Maps With Values In S² And Some Numerical Simulations
- … us to say that the solution w h n of (3.1) is unique and satisfies the problem a(w h n ; OE h…
- Cited by 1 (0 self) – Add To MetaCart
Showing 1 through 8.
