R. Chang and J. Kadin. On the structure of uniquely satisfiable formulas. Technical Report 90-1124, Department of Computer Science, Cornell University, May 1990. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
On Unique Satisfiability and Randomized Reductions - Chang, Rohatgi Self-citation (Chang) (Correct)
....Similarly, one can show that SATSAT cannot have OR unless PH collapses [CK90b] These results show that SATSAT does not have the same robust properties of SAT. So, how does USAT, the vv m complete set for D P , compare with the P m complete set As it turns out, Chang and Kadin [CK90c] recently showed that USAT 62 co D P unless PH collapses, USAT does not have OR unless PH collapses. From these results it would appear that vv m complete sets behave much like the P m complete sets and this is true in spite of the fact that the Valiant Vazirani reduction cannot ....
R. Chang and J. Kadin. On the structure of uniquely satisfiable formulas. Technical Report 90-1124, Department of Computer Science, Cornell University, May 1990.
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