Richard Chang, Pankaj Rohatgi  Home/Search
Context
Related
| nec.com/homepages/fortnow...column42.ps Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: nec.com/homepages/fortnow/beat... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Ever since Valiant and Vazirani [VV86] showed that there exists a random reduction from SAT to USAT, the complexity of USAT has been cited as "USAT is complete for D P under randomized reductions." However, the definition of the randomized reduction was never quite satisfying because the probability of a "correct" reduction can approach zero as the length of the formula increases. The discrepancy between the Valiant-Vazirani definition and the earlier Adleman-Manders [AM77] definition... (Update)
Similar documents based on text: More All
0.7: On Unique Satisfiability and the Threshold Behavior of.. - Richard Chang (1995) (Correct)
0.6: Boolean Complexity Classes Vs. Their Arithmetic - Analogs Anna Al (Correct)
0.4: Mclnnes, J., "Cryptography Using Weak Sources of.. - Naor Personal.. (1991) (Correct)
BibTeX entry: (Update)
@article{ chang90unique,
author = "R. Chang and P. Rohatgi",
title = "On Unique Satisfiability and Randomized Reductions",
journal = "Bulletin of the European Association for Theoretical Computer Science",
volume = "42",
pages = "151--159",
year = "1990",
url = "citeseer.ist.psu.edu/396123.html" }
Citations (may not include all citations):172 Algebraic methods for interactive proof systems - Lund, Fortnow et al. - 1990
163 NP is as easy as detecting unique solutions (context) - Valiant, Vazirani - 1986
144 The NP-completeness column: An ongoing guide (context) - Johnson - 1985
66 PP is closed under intersection - Beigel, Reingold et al. - 1990
56 The polynomial time hierarchy collapses if the Boolean hiera.. (context) - Kadin - 1988
53 Counting classes are at least as hard as the polynomial-time.. (context) - Toda, Ogiwara - 1990
44 the computational power of PP and \Phi P (context) - Toda - 1989
39 and some facets of complexity (context) - Papadimitriou, Yannakakis et al. - 1984
37 The Boolean hierarchy and the polynomial hierarchy: a closer.. - Chang, Kadin - 1990
35 The Boolean hierarchy II: Applications (context) - Cai, Gundermann et al. - 1989
31 NP-hard sets are p-superterse unless R = NP - Beigel - 1988
26 A survey of counting classes (context) - Gundermann, Nasser et al. - 1990
23 The Boolean hierarchy: Hardware over NP (context) - Cai, Hemachandra - 1986
20 the unique satisfiability problem (context) - Blass, Gurevich - 1982
14 On computing Boolean connectives of characteristic functions (context) - Chang, Kadin - 1990
[Article contains additional citations not shown here]
Documents on the same site (http://external.nj.nec.com/homepages/fortnow/beatcs/): More
The Computational Complexity Column - Fortnow (Correct)
On Regularity-Preserving Functions - Kozen (1995) (Correct)
On IP = PSPACE and Theorems with Narrow Proofs - Hartmanis, Chang, Ranjan.. (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC