Author： Ablayev
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.264, Iss.1, 2001-08, pp. : 127-137
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
A read-once lower bound and a (1,+k)-hierarchy for branching programs
By Savicky P. Zak
Theoretical Computer Science, Vol. 238, Iss. 1, 2000-05 ,pp. :
Access to resources
Recommend
NP &unknown; co-NP and models of arithmetic
By Sureson C.
Theoretical Computer Science, Vol. 147, Iss. 1, 1995-08 ,pp. :
AM exp &unknown;(NP&unknown;coNP)/poly
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :
P, NP, Co-NP and weak systems of arithmetic
By Sureson C.
Theoretical Computer Science, Vol. 154, Iss. 2, 1996-02 ,pp. :
On the shrinkage exponent for read-once formulae
By Hastad J. Razborov A. Yao A.
Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. :