Predicate classes and promise classes

Considering computation trees produced by polynomial time nondeterministic computations one can define a complexity class by any predicate on computation trees, such classes will be called predicate classes. It will be shown that these classes are exactly the principal ideals of the polynomial time many-one reducibility. Additionally, the set of classes-which are called promise classes-definable by promise functions instead of predicates are shown to be equal to the set of countable ideals.<<ETX>>

[1]  Richard E. Ladner,et al.  On the Structure of Polynomial Time Reducibility , 1975, JACM.

[2]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[3]  Leonard M. Adleman,et al.  Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Klaus Ambos-Spies.  On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems , 1989, Theor. Comput. Sci..

[5]  Theodore A. Slaman,et al.  On the Theory of the PTIME Degrees of the Recursive Sets , 1990, J. Comput. Syst. Sci..

[6]  Michael Sipser,et al.  On Relativization and the Existence of Complete Sets , 1982, ICALP.

[7]  Klaus Ambos-Spies.  A Note on the Complete Problems for Complexity Classes , 1986, Inf. Process. Lett..

[8]  Yacov Yacobi,et al.  The Complexity of Promise Problems with Applications to Public-Key Cryptography , 1984, Inf. Control..

[9]  R. Solovay,et al.  Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .

[10]  John Gill,et al.  Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..

[11]  Ulrich Hertrampf.  Locally Definable Acceptance Types for Polynomial Time Machines , 1992, STACS.

[12]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[13]  Wojciech Kowalczyk,et al.  Some Connections between Representability of Complexity Classes and the Power of Formal Systems of Reasoning , 1984, MFCS.

[14]  Pierluigi Crescenzi,et al.  A Uniform Approach to Define Complexity Classes , 1992, Theor. Comput. Sci..

[15]  Thomas Schwentick,et al.  On the power of polynomial time bit-reductions , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[16]  Denis Thérien,et al.  Logspace and logtime leaf languages , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[17]  John E. Hopcroft,et al.  Complexity of Computer Computations , 1974, IFIP Congress.

[18]  Pierluigi Crescenzi,et al.  Complexity classes and sparse oracles , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[19]  Juris Hartmanis,et al.  Complexity Classes without Machines: On Complete Languages for UP , 1988, Theor. Comput. Sci..