T. Gundermann and G. Wechsung. Nondeterministic Turing machines with modified acceptance. In Proceedings of Mathematical Foundations of Computer Science 1986, Springer Verlag Lecture Notes in Computer Science #233, pages 396--404, 1986. 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 (Correct)
....question, we return to USAT. Suppose someone were to construct a randomized reduction from SAT to USAT with probability 1=2 1=poly. Then, USAT would be complete for D P in a much stronger sense. In fact, such a theorem would answer the frequently posed question of whether USAT has OR 2 [CH86, GW86, CGH 89, GNW90] It is known that SATSAT does not have OR 2 unless PH collapses [CK90b] Corollary 4. If SAT rp m USAT with probability 1=2 1=p(n) for some polynomial bound p, then USAT does not have OR 2 unless PH collapses. Proof: We know that SAT P m USAT. By assumption, SAT rp ....
T. Gundermann and G. Wechsung. Nondeterministic Turing machines with modified acceptance. In Proceedings of Mathematical Foundations of Computer Science 1986, Springer Verlag Lecture Notes in Computer Science #233, pages 396--404, 1986.
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