Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Beigel, Richard
and
Gasarch, William I.
1989.
On the complexity of finding the chromatic number of a recursive graph I: the bounded case.
Annals of Pure and Applied Logic,
Vol. 45,
Issue. 1,
p.
1.
Beigel, Richard
1991.
Bounded queries to SAT and the Boolean hierarchy.
Theoretical Computer Science,
Vol. 84,
Issue. 2,
p.
199.
Gasarch, W.
1991.
Bounded queries in recursion theory: a survey.
p.
62.
Kummer, Martin
and
Stephan, Frank
1994.
Effective Search Problems.
Mathematical Logic Quarterly,
Vol. 40,
Issue. 2,
p.
224.
Case, John
Kaufmann, Susanne
Kinber, Efim
and
Kummer, Martin
1995.
Computational Learning Theory.
Vol. 904,
Issue. ,
p.
140.
Kaufmann, Susanne
and
Kummer, Martin
1995.
Mathematical Foundations of Computer Science 1995.
Vol. 969,
Issue. ,
p.
169.
Chang, R.
Gasarch, W.
and
Toran, J.
1995.
On finding the number of graph automorphisms.
p.
288.
Case, John
Kaufmann, Susanne
Kinber, Efim
and
Kummer, Martin
1997.
Learning Recursive Functions from Approximations.
Journal of Computer and System Sciences,
Vol. 55,
Issue. 1,
p.
183.
Ambainis, A.
Buhrman, H.
Gasarch, W.
Kalyanasundaram, B.
and
Torenvliet, L.
2000.
The communication complexity of enumeration, elimination, and selection.
p.
44.
Ambainis, Andris
Buhrman, Harry
Gasarch, William
Kalyanasundaram, Bala
and
Torenvliet, Leen
2001.
The Communication Complexity of Enumeration, Elimination, and Selection.
Journal of Computer and System Sciences,
Vol. 63,
Issue. 2,
p.
148.
Tantau, Till
2002.
Mathematical Foundations of Computer Science 2002.
Vol. 2420,
Issue. ,
p.
625.
Tantau, Till
2003.
Fundamentals of Computation Theory.
Vol. 2751,
Issue. ,
p.
400.
Gasarch, William
2003.
Computability and Models.
p.
161.
Nickelsen, Arfst
and
Tantau, Till
2003.
Partial information classes.
ACM SIGACT News,
Vol. 34,
Issue. 1,
p.
32.
Amir, Amihood
Beigel, Richard
and
Gasarch, William
2003.
Some connections between bounded query classes and non-uniform complexity.
Information and Computation,
Vol. 186,
Issue. 1,
p.
104.
Merkle, Wolfgang
and
Stephan, Frank
2007.
On C-Degrees, H-Degrees and T-Degrees.
p.
60.
Jain, Sanjay
Stephan, Frank
and
Teutsch, Jason
2009.
Mathematical Theory and Computational Practice.
Vol. 5635,
Issue. ,
p.
270.
Jain, Sanjay
Stephan, Frank
and
Teutsch, Jason
2011.
Index sets and universal numberings.
Journal of Computer and System Sciences,
Vol. 77,
Issue. 4,
p.
760.
Monin, Benoit
and
Nies, Andre
2015.
A Unifying Approach to the Gamma Question.
p.
585.
Teutsch, Jason
and
Zimand, Marius
2016.
A Brief on Short Descriptions.
ACM SIGACT News,
Vol. 47,
Issue. 1,
p.
42.