Author： Sureson C.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.154, Iss.2, 1996-02, pp. : 145-163
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
AM exp &unknown;(NP&unknown;coNP)/poly
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
NP-Logic Systems and Model-Equivalence Reductions
By Shen Yu-Ping
Journal of Computer Science and Technology, Vol. 25, Iss. 6, 2010-11 ,pp. :
The synthesis problem for elementary net systems is NP-complete
By Badouel E. Bernadinello L. Darondeau P.
Theoretical Computer Science, Vol. 186, Iss. 1, 1997-10 ,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. :