Author： Schapire R.E.
Publisher： Springer Publishing Company
ISSN： 0885-6125
Source： Machine Learning, Vol.14, Iss.1, 1994-01, pp. : 47-81
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
Access to resources
Recommend
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. :
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. :
Exact Learning of Formulas in Parallel
By Bshouty N.H.
Machine Learning, Vol. 26, Iss. 1, 1997-01 ,pp. :