L. Fortnow and M. Sipser, "Are there interactive protocols for co-NP languages?" Information Processing Letters, Vol. 28, pp. 249--251, 1988. Suggests that co-NP may not be contained in IP. [35] later proved the contrary. 12 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Algorithms for Quantum Computation: Discrete Logarithms and.. - Shor (1994) (156 citations) (Correct)
....a quantum computer cannot invert one way functions, but only proves this for one way oracles, i.e. black box functions given as a subroutine which the quantum computer is not allowed to look inside. Such oracle results have been misleading in the past, most notably in the case of IP = PSPACE [15, 28]. A third approach, which we take, is to solve in BQP some well studied problem for which no polynomial time algorithm is known. This shows that the extra power conferred by quantum interference is at least hard to achieve using classical computation. Both Bernstein and Vazirani [5] and Simon [29] ....
L. Fortnowand M. Sipser, "Are there interactive protocols for co-NP languages?" Inform. Proc. Lett. Vol. 28, pp. 249--251 (1988).
Software Reliability via Run-Time Result-Checking - Manuel Blum Hal (1994) (54 citations) (Correct)
No context found.
L. Fortnow and M. Sipser, "Are there interactive protocols for co-NP languages?" Information Processing Letters, Vol. 28, pp. 249--251, 1988. Suggests that co-NP may not be contained in IP. [35] later proved the contrary. 12
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