Author： Hastad J. Razborov A. Yao A.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.141, Iss.1, 1995-04, pp. : 269-282
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
Learning Probabilistic Read-once Formulas on Product Distributions
Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. :
Access to resources
Recommend
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. :
On BPP versus NP&unknown;coNP for ordered read-once branching programs
By Ablayev
Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. :
Sturmian words and words with a critical exponent
By Vandeth D.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :