Author： Lautemann C. Schwentick T. Stewart I.A.
Publisher： Academic Press
ISSN： 0890-5401
Source： Information and Computation, Vol.147, Iss.2, 1998-12, pp. : 145-170
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
On certain positive linear operators in polynomial weight spaces
By Walczak Z.
Acta Mathematica Hungarica, Vol. 101, Iss. 3, 2003-11 ,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. :