| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe |
Computability in Europe 2009.  |
Ann. Pure Appl. Logic  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Timur Bakibayev |
Comparing Nontriviality for E and EXP. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Serikzhan Badaev, Sergey S. Goncharov |
Inductive inference and computable numberings. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Thorsten Kräling |
Quantitative aspects of speed-up and gap phenomena. |
Mathematical Structures in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Timur Bakibayev |
Weak Completeness Notions for Exponential Time. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Timur Bakibayev |
Nontriviality for Exponential Time w.r.t. Weak Reducibilities. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Decheng Ding, Wei Wang, Liang Yu |
Bounding non-GL2 and R.E.A. |
J. Symb. Log. |
2009 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Thorsten Kräling |
Quantitative Aspects of Speed-Up and Gap Phenomena. |
TAMC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Benedikt Löwe, Wolfgang Merkle (eds.) |
Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Serikzhan Badaev, Sergey Goncharov 0002 |
On a Question of Frank Stephan. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
computable family of sets, TxtEX learning, equivalent numberings |
| 1 | Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman |
Comparing DNR and WWKL. |
J. Symb. Log. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Edgar Busse |
Computational Aspects of Disjunctive Sequences. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn |
Almost complete sets. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Edgar Busse |
Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata. |
DMTCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Problems with Cannot Be Reduced to Any Proper Subproblems. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Peter A. Fejer |
Embedding of N5 and the contiguous degrees. |
Ann. Pure Appl. Logic |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Frank Stephan |
Hausdorff Dimension in Exponential Time. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng |
Weakly Computable Real Numbers. |
J. Complexity |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore |
Undecidability and 1-types in intervals of the computably enumerable degrees. |
Ann. Pure Appl. Logic |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Levke Bentzien |
Separating NP-Completeness Notions under Strong Hypotheses. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Measure Theoretic Completeness Notions for the Exponential Time Classes. |
MFCS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn |
Almost Complete Sets. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt |
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
Resource Bounded Randomness and Weakly Complete Problems. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Levke Bentzien |
Separating NP-Completeness Notions under Strong Hypotheses. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
NP-completeness notions separation, strong hypotheses, NP-m-completeness, NP-T-completeness, bounded-query reducibilities, resource bounded Baire category concept, computational complexity, resource bounded measure |
| 1 | Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn |
Genericity and Measure for Exponential Time. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp, Manuel Lerman |
Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. |
J. Symb. Log. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Elvira Mayordomo, Yongge Wang, Xizhong Zheng |
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness. |
STACS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Elvira Mayordomo, Xizhong Zheng |
A Comparison of Weak Completeness Notions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
Weak Completeness, Measure, Genericity, Completeness |
| 1 | Klaus Ambos-Spies |
On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract). |
ICALP |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Resource-Bounded Genericity. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Decheng Ding, Klaus Ambos-Spies |
Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees. |
Math. Log. Q. |
1994 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
Minimal Pairs and Complete Problems. |
Theor. Comput. Sci. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn |
Genericity and Measure for Exponential Time. |
MFCS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
Resource Bounded Randomness and Weakly Complete Problems. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare |
The Continuity of Cupping to 0'. |
Ann. Pure Appl. Logic |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Richard A. Shore |
Undecidability and 1-Types in the Recursively Enumerable Degrees. |
Ann. Pure Appl. Logic |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Uwe Schöning (eds.) |
Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992 |
Complexity Theory: Current Research |
1993 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, André Nies, Richard A. Shore |
The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability. |
J. Symb. Log. |
1992 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, André Nies |
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable. |
STACS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Steven Homer, Robert I. Soare |
Minimal Pairs and Complete Problems. |
STACS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. |
Theor. Comput. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Manuel Lerman |
Lattice Embeddings into the Recursively Enumerable Degrees II. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Robert I. Soare |
The Recursively Enumerable Degrees have Infinitely Many One-Types. |
Ann. Pure Appl. Logic |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Honest Polynomial Time Reducibilities and the P = ? NP Problem. |
J. Comput. Syst. Sci. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Dongping Yang |
Honest Polynomial-Time Degrees of Elementary Recursive Sets. |
CSL |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Peter A. Fejer |
Degree Theoretical Splitting Properties of Recursively Enumerable Sets. |
J. Symb. Log. |
1988 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Jürgen Kämper |
On Disjunctive Self-Reducibility. |
CSL |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig |
Diagonalizations over Polynomial Time Computable Sets. |
Theor. Comput. Sci. |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Minimal Pairs for Polynomial Time Reducibilities. |
Computation Theory and Logic |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig |
Diagonalizing over Deterministic Polynomial Time. |
CSL |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets. |
Inf. Process. Lett. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
A Note on the Complete Problems for Complexity Classes. |
Inf. Process. Lett. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies, Manuel Lerman |
Lattice Embeddings into the Recursively Enumerable Degrees. |
J. Symb. Log. |
1986 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
An Inhomogeneity in the Structure of Karp Degrees. |
SIAM J. Comput. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Randomness, Relativizations, and Polynomial Reducibilities. |
Structure in Complexity Theory Conference |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Sublattices of the Polynomial Time Degrees |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
On the Relative Complexity of Subproblems of Intractable Problems. |
STACS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
Three Theorems on Polynomial Degrees of NP-Sets |
FOCS |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
An Extension of the Nondiamond Theorem in Classical and alpha-Recursion Theory. |
J. Symb. Log. |
1984 |
DBLP BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
P-Generic Sets. |
ICALP |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
On the Structure of Polynomial Time Degrees. |
STACS |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Ambos-Spies |
P-mitotic sets. |
Logic and Machines |
1983 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")