Author： Sureson C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.147, Iss.1, 1995-08, pp. : 55-67
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
P, NP, Co-NP and weak systems of arithmetic
By Sureson C.
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
Access to resources
Recommend
AM exp &unknown;(NP&unknown;coNP)/poly
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
On BPP versus NP&unknown;coNP for ordered read-once branching programs
By Ablayev
Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,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. :
Complete problems for monotone NP
By Stewart I.A.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :