Author: Burgisser P.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.235, Iss.1, 2000-03, pp. : 71-88
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
Cook versus Karp-Levin: Separating completeness notions if NP is not small
Theoretical Computer Science, Vol. 164, Iss. 1, 1996-09 ,pp. :
Hypothesis versus theory: part of a hierarchy of truth
By Wolf Karl
International Journal of General Systems, Vol. 36, Iss. 5, 2007-10 ,pp. :
Implementing Valiant's Learnability Theory Using Random Sets
By Oblow E.M.
Machine Learning, Vol. 08, Iss. 1, 1992-01 ,pp. :
Context-free recognition via shortest paths computation: a version of Valiant's algorithm
By Rytter W.
Theoretical Computer Science, Vol. 143, Iss. 2, 1995-06 ,pp. :