Author： Voronenko A.
Publisher： Springer Publishing Company
ISSN： 1046-283X
Source： Computational Mathematics and Modeling, Vol.22, Iss.1, 2011-01, pp. : 81-91
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
The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence, Vol. 36, Iss. 4, 2002-12 ,pp. :
Access to resources
Recommend
On the parity of generalized partition functions II
By Nicolas J-L.
Periodica Mathematica Hungarica, Vol. 43, Iss. 1-2, 2002-08 ,pp. :
Learning via finitely many queries
By Lee Andrew
Annals of Mathematics and Artificial Intelligence, Vol. 44, Iss. 4, 2005-08 ,pp. :
Completeness and Non-Completeness Results with Respect to Read-Once Projections
Information and Computation, Vol. 143, Iss. 1, 1998-05 ,pp. :
A tail bound for read‐k families of functions
RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. :