Author： Koiran P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.215, Iss.1, 1999-02, pp. : 289-304
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
Bounding queries in the analytic polynomial-time hierarchy
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
Special Issue on Polynomial Elimination Foreword of the Guest Editors
Journal of Symbolic Computation, Vol. 28, Iss. 1, 1999-07 ,pp. :
By Viry P.
Journal of Symbolic Computation, Vol. 28, Iss. 3, 1999-09 ,pp. :
Hyper-polynomial hierarchies and the polynomial jump
By Fenner
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
Space hierarchy theorem revised
By Geffert V.
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :