PSPACE has constant-round quantum interactive proof systems

Author： Watrous J.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.292, Iss.3, 2003-01, pp. : 575-588

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Low-randomness constant-round private XOR computations

By Blundo Carlo   Galdi Clemente   Persiano Giuseppe  

International Journal of Information Security (IJIS), Vol. 6, Iss. 1, 2007-01 ,pp. : 15-26

Springer Publishing Company

Access to resources Recommend Favorite

Interactive and Probabilistic Proof of Mobile Code Safety

By Tsukada Yasuyuki  

Automated Software Engineering, Vol. 12, Iss. 2, 2005-04 ,pp. : 237-257

Springer Publishing Company

Access to resources Recommend Favorite

A Framework for Proof Systems

By Nigam Vivek   Miller Dale  

Journal of Automated Reasoning, Vol. 45, Iss. 2, 2010-08 ,pp. : 157-188

Springer Publishing Company

Access to resources Recommend Favorite

Algebraic proof systems over formulas

By Grigoriev D.   Hirsch E.A.  

Theoretical Computer Science, Vol. 303, Iss. 1, 2003-06 ,pp. : 83-102

Elsevier

Access to resources Recommend Favorite

The structural model of general systems and its proof

By Lin Fuyong   Cheng T C Edwin  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 27, Iss. 9, 1998-09 ,pp. : 1062-1074

Emerald Group Publishing Ltd

Access to resources Recommend Favorite