Author： Geffert V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.295, Iss.1, 2003-02, pp. : 171-187
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
Bell's theorem from Moore's theorem
By Fields Chris
International Journal of General Systems, Vol. 42, Iss. 4, 2013-05 ,pp. :
Access to resources
Recommend
Elimination of parameters in the polynomial hierarchy
By Koiran P.
Theoretical Computer Science, Vol. 215, Iss. 1, 1999-02 ,pp. :
A hierarchy of temporal logics with past
By Laroussinie F. Schnoebelen P.
Theoretical Computer Science, Vol. 148, Iss. 2, 1995-09 ,pp. :
A Constructive Algebraic Hierarchy in Coq
By Geuvers H. Pollack R. Wiedijk F. Zwanenburg J.
Journal of Symbolic Computation, Vol. 34, Iss. 4, 2002-10 ,pp. :
A hierarchy based on output multiplicity
By Naik A.V. Rogers J.D. Royer J.S. Selman A.L.
Theoretical Computer Science, Vol. 207, Iss. 1, 1998-10 ,pp. :