Author： Savicky P. Zak
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.238, Iss.1, 2000-05, pp. : 347-362
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
On BPP versus NP&unknown;coNP for ordered read-once branching programs
By Ablayev
Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. :
Access to resources
Recommend
A lower bound on branching programs reading some bits twice
By Savicky P. Zak S.
Theoretical Computer Science, Vol. 172, Iss. 1, 1997-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. :
Learning Probabilistic Read-once Formulas on Product Distributions
Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. :