Author： Boros Endre
Publisher： Springer Publishing Company
ISSN： 1012-2443
Source： Annals of Mathematics and Artificial Intelligence, Vol.57, Iss.3-4, 2009-12, pp. : 249-291
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
Bounds on learning in polynomial time
Philosophical Magazine B, Vol. 77, Iss. 5, 1998-05 ,pp. :
Access to resources
Recommend
Positive Versions of Polynomial Time
By Lautemann C. Schwentick T. Stewart I.A.
Information and Computation, Vol. 147, Iss. 2, 1998-12 ,pp. :
Packing cycles exactly in polynomial time
By Chen Qin
Journal of Combinatorial Optimization, Vol. 23, Iss. 2, 2012-02 ,pp. :
Almost-Everywhere Superiority for Quantum Polynomial Time
By Hemaspaandra E. Hemaspaandra L.A. Zimand M.
Information and Computation, Vol. 175, Iss. 2, 2002-06 ,pp. :