Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Bennison, Victor L.
and
Soare, Robert I.
1977.
Recursion theoretic characterizations of complexity theoretic properties.
p.
100.
Bennison, Victor L.
and
Soare, Robert I.
1978.
Some lowness properties and computational complexity sequences.
Theoretical Computer Science,
Vol. 6,
Issue. 3,
p.
233.
Soare, Robert I.
1978.
Recursively enumerable sets and degrees.
Bulletin of the American Mathematical Society,
Vol. 84,
Issue. 6,
p.
1149.
Bennison, Victor L.
1979.
Theoretical Computer Science 4th GI Conference.
Vol. 67,
Issue. ,
p.
58.
Homer, Steven
and
Jacobs, Barry E.
1981.
Degrees of Non α‐Speedable Sets.
Mathematical Logic Quarterly,
Vol. 27,
Issue. 31-35,
p.
539.
Soare, Robert I.
1982.
Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets.
Annals of Mathematical Logic,
Vol. 22,
Issue. 1,
p.
69.
Soare, Robert I.
and
Stob, Michael
1982.
Proceedings of the Herbrand Symposium.
Vol. 107,
Issue. ,
p.
299.
Fejer, Peter A.
1982.
Branching degrees above low degrees.
Transactions of the American Mathematical Society,
Vol. 273,
Issue. 1,
p.
157.
Soare, Robert I.
1982.
Computational complexity of recursively enumerable sets.
Information and Control,
Vol. 52,
Issue. 1,
p.
8.
Ko, Ker-I
1983.
On self-reducibility and weak P-selectivity.
Journal of Computer and System Sciences,
Vol. 26,
Issue. 2,
p.
209.
Ambos-Spies, Klaus
Jockusch, Carl G.
Shore, Richard A.
and
Soare, Robert I.
1984.
An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees.
Transactions of the American Mathematical Society,
Vol. 281,
Issue. 1,
p.
109.
Omanadze, R. Sh.
1984.
Upper semilattice of recursively enumerable 124-1124-1124-1-degrees.
Algebra and Logic,
Vol. 23,
Issue. 2,
p.
124.
Orponen, Pekka
Russo, David A.
and
Schöning, Uwe
1985.
Automata, Languages and Programming.
Vol. 194,
Issue. ,
p.
435.
Ko, Ker-I
1985.
Nonlevelable sets and immune sets in the accepting density hierarchy inNP.
Mathematical Systems Theory,
Vol. 18,
Issue. 1,
p.
189.
Ko, Ker-I
and
Schöning, Uwe
1985.
On Circuit-Size Complexity and the Low Hierarchy in NP.
SIAM Journal on Computing,
Vol. 14,
Issue. 1,
p.
41.
Orponen, Pekka
Russo, David A.
and
Schöning, Uwe
1986.
Optimal Approximations and Polynomially Levelable Sets.
SIAM Journal on Computing,
Vol. 15,
Issue. 2,
p.
399.
Yuefei, Sui
1987.
Some results about the R.E. degrees.
Acta Mathematica Sinica,
Vol. 3,
Issue. 2,
p.
170.
Downey, R. G.
and
Jockusch, C. G.
1987.
T-degrees, jump classes, and strong reducibilities.
Transactions of the American Mathematical Society,
Vol. 301,
Issue. 1,
p.
103.
Downey, R.G.
and
Slaman, T.A.
1989.
Completely mitotic R.E. degrees.
Annals of Pure and Applied Logic,
Vol. 41,
Issue. 2,
p.
119.
Omanadze, R. Sh.
1989.
Classes of recursively enumerable sets and Q-reducibility.
Mathematical Notes of the Academy of Sciences of the USSR,
Vol. 45,
Issue. 2,
p.
141.