Author： Vinodchandran N.V.
Publisher： Elsevier
ISSN： 0020-0190
Source： Information Processing Letters, Vol.89, Iss.1, 2004-01, pp. : 43-47
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
NP &unknown; co-NP and models of arithmetic
By Sureson C.
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. :
Access to resources
Recommend
On BPP versus NP&unknown;coNP for ordered read-once branching programs
By Ablayev
Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. :
P, NP, Co-NP and weak systems of arithmetic
By Sureson C.
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
If NP has polynomial-size circuits, then MA = AM
By Arvind V. Kobler J. Schoning U. Schuler R.
Theoretical Computer Science, Vol. 137, Iss. 2, 1995-01 ,pp. :
Recognizing string graphs in NP
By Schaefer M. Sedgwick E. Stefankovic D.
Journal of Computer and System Sciences, Vol. 67, Iss. 2, 2003-09 ,pp. :