Searching for "On Many-One Degrees." – sorted by Relevance.
-
Model Theory of the Computably Enumerable Many-One Degrees
- Model theory of the computably enumerable many-one degrees ANDRE NIES, Department of Mathematics
- Cited by 3 (3 self) – Add To MetaCart
-
Collapsing Polynomial-Time Degrees
- to the r 0 -degree of A if both degrees coincide. We investigate for the polynomial-time bounded many-one
- Cited by 4 (0 self) – Add To MetaCart
-
Collapsing Polynomial-Time Degrees
- to the r 0 -degree of A if both degrees coincide. We investigate for the polynomial-time bounded many-one
- Add To MetaCart
-
Global Properties of Degree Structures
- investigate degree structures induced by many-one reducibility and Turing reducibility on the computably
- Cited by 2 (2 self) – Add To MetaCart
-
On the Structures Inside Truth-Table Degrees
- truthtable degree contains an infinite antichain of many-one degrees. Some but not all truth-table degrees
- Cited by 3 (2 self) – Add To MetaCart
-
Report Series Indifferent Sets
- real number in every non-trivial many-one degree. 1 Introduction Intuitively a random sequence A of 0s
- Add To MetaCart
-
Decidability Of The Two-Quantifier Theory Of The Recursively Enumerable Weak Truth-Table Degrees
- sets but also to various substructures of the polynomial many-one (pm) degrees of the recursive sets
- Cited by 4 (0 self) – Add To MetaCart
-
Undecidability Results for low complexity time classes
- reducibility like polynomial time many--one or Turing reducibility induces a nontrivial degree structure
- Cited by 3 (3 self) – Add To MetaCart
-
Undecidability Results for Low Complexity Time Classes
- reducibility like polynomial time many--one or Turing reducibility induces a nontrivial degree structure
- Add To MetaCart
-
Undecidability Results for Low Complexity Degree Structures
- DTIME�h�. Thus, for instance the polynomial T-degrees and many�one degrees of languages in EXPTIME
- Cited by 4 (2 self) – Add To MetaCart

