Klaus Ambos-Spies

发表

Genericity and Measure for Exponential Time

Sebastiaan Terwijn, Klaus Ambos-Spies, Hans-Christian Neis, 1994, Theor. Comput. Sci..

Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem

Klaus Ambos-Spies, 1987, Computational Complexity Conference.

Sublattices of the Polynomial Time Degrees

Klaus Ambos-Spies, 1985, Inf. Control..

Minimal Pairs for Polynomial Time Reducibilities

Klaus Ambos-Spies, 1987, Computation Theory and Logic.

Nontriviality for Exponential Time w.r.t. Weak Reducibilities

Klaus Ambos-Spies, Timur Bakibayev, 2010, TAMC.

Quantitative Aspects of Speed-Up and Gap Phenomena

Klaus Ambos-Spies, Thorsten Kräling, 2009, TAMC.

Computability Theory (Dagstuhl Seminar 17081)

Rodney G. Downey, Steffen Lempp, Klaus Ambos-Spies, 2017, Dagstuhl Reports.

Hausdorff dimension in exponential time

Frank Stephan, Wolfgang Merkle, Klaus Ambos-Spies, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Cappable recursively enumerable degrees and Post's program

André Nies, Klaus Ambos-Spies, 1992, Arch. Math. Log..

Honest Polynomial Time Reducibilities and the P = ? NP Problem

Klaus Ambos-Spies, K. Ambos-Spies, 1989, J. Comput. Syst. Sci..

Normalized Information Distance and the Oscillation Hierarchy pdf

Sebastiaan Terwijn, Wolfgang Merkle, Klaus Ambos-Spies, 2017, ArXiv.

Automatic Forcing and Genericity: On the Diagonalization Strength of Finite Automata

Klaus Ambos-Spies, Edgar Busse, 2003, DMTCS.

On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets

Klaus Ambos-Spies, K. Ambos-Spies, 2017, Computability and Complexity.

Degrees of Unsolvability

Klaus Ambos-Spies, Peter A. Fejer, K. Ambos-Spies, 2014, Computational Logic.

Comparing Nontriviality for E and EXP

Klaus Ambos-Spies, Timur Bakibayev, 2011, Theory of Computing Systems.

Resource Bounded Randomness and Weakly Complete Problems

Sebastiaan Terwijn, Klaus Ambos-Spies, Xizhong Zheng, 1994, Theor. Comput. Sci..

On Optimal Polynomial Time Approximations: P-Levelability vs. Delta-Levelability (Extended Abstract)

Klaus Ambos-Spies, 1995, ICALP.

On the structure of the polynomial time degrees of recursive sets

Klaus Ambos-Spies, 1985, Forschungsberichte.

On the Differences and Sums of Strongly Computably Enumerable Real Numbers

Klaus Ambos-Spies, Xizhong Zheng, K. Ambos-Spies, 2019, CiE.

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

Yun Fan, Wolfgang Merkle, Klaus Ambos-Spies, 2012, Theory of Computing Systems.

Nontriviality for exponential time w.r.t. weak reducibilities

Klaus Ambos-Spies, Timur Bakibayev, 2013, Theor. Comput. Sci..

Lattice embeddings into the recursively enumerable degrees. II

Manuel Lerman, Klaus Ambos-Spies, M. Lerman, 1989, Journal of Symbolic Logic.

On the Relative Complexity of Subproblems of Intractable Problems

Klaus Ambos-Spies, 1985, STACS.

On a Question of Frank Stephan

Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov, 2008, TAMC.

Honest Polynomial-Time Degrees of Elementary Recursive Sets

Klaus Ambos-Spies, Dongping Yang, K. Ambos-Spies, 1990, CSL.

Embedding of N5 and the contiguous degrees

Klaus Ambos-Spies, Peter A. Fejer, 2001, Ann. Pure Appl. Log..

Real Benefit of Promises and Advice

Ulrike Brandt, Martin Ziegler, Klaus Ambos-Spies, 2013, CiE.

Almost complete sets

Sebastiaan Terwijn, Wolfgang Merkle, Klaus Ambos-Spies, 2003, Theor. Comput. Sci..

Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets

Steffen Lempp, Gunther Mainhardt, Klaus Ambos-Spies, 1998, MFCS.

Undecidability and 1-Types in the Recursively Enumerable Degrees

Richard A. Shore, Klaus Ambos-Spies, R. Shore, 1993, Ann. Pure Appl. Log..

Preface

Klaus Ambos-Spies, Joan Bagaria, Ulrich Kohlenbach, 2013, Ann. Pure Appl. Log..

Polynomial Time Reducibilities and Degrees

Klaus Ambos-Spies, 1999, Handbook of Computability Theory.

An extension of the nondiamond theorem in classical and α-recursion theory

Klaus Ambos-Spies, K. Ambos-Spies, 1984, Journal of Symbolic Logic.

An Inhomogeneity in the Structure of Karp Degrees

Klaus Ambos-Spies, 1986, SIAM J. Comput..

Resource-Bounded Measure and Randomness

Klaus Ambos-Spies, Elvira Mayordomo, K. Ambos-Spies, 2019, complexity, logic, and recursion theory.

Weak Completeness Notions for Exponential Time

Klaus Ambos-Spies, Timur Bakibayev, K. Ambos-Spies, 2010, Theory of Computing Systems.

Three theorems on polynomial degrees of NP-sets

Klaus Ambos-Spies, 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

Multiple Permitting and Array Noncomputability

Klaus Ambos-Spies, K. Ambos-Spies, 2018, CiE.

Undecidability and 1-types in intervals of the computably enumerable degrees

Denis R. Hirschfeldt, Richard A. Shore, Klaus Ambos-Spies, 2000, Ann. Pure Appl. Log..

The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent

Yun Fan, Klaus Ambos-Spies, Thorsten Kräling, 2013, Ann. Pure Appl. Log..

Nontriviality and Strong Nontriviality for Exponential Time: Invited Presentation at Seventh International Conference on Computability and Complexity in Analysis

Klaus Ambos-Spies, 2010 .

Weak Completeness Notions for Exponential Time

Klaus Ambos-Spies, Timur Bakibayev, 2010, ICALP.

Randomness, Relativizations, and Polynomial Reducibilities

Klaus Ambos-Spies, K. Ambos-Spies, 1986, SCT.

Separating NP-completeness notions under strong hypotheses

Klaus Ambos-Spies, Levke Bentzien, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Weakly Computable Real Numbers

Klaus Weihrauch, Klaus Ambos-Spies, Xizhong Zheng, 2000, J. Complex..

Resource-bounded genericity

Klaus Ambos-Spies, K. Ambos-Spies, 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8, 1992

Uwe Schöning, Klaus Ambos-Spies, Steven Homer, 1993, Complexity Theory: Current Research.

Computability in Europe 2009

Samuel R. Buss, Benedikt Löwe, Klaus Ambos-Spies, 2012, Ann. Pure Appl. Log..

Quantitative aspects of speed-up and gap phenomena

Klaus Ambos-Spies, Thorsten Kräling, 2010, Math. Struct. Comput. Sci..

Anti-Mitotic Recursively Enumerable Sets

Klaus Ambos-Spies, K. Ambos-Spies, 1985, Math. Log. Q..

P-mitotic sets

Klaus Ambos-Spies, 1983, Logic and Machines.

Computability in Europe 2009

Erzsébet Csuhaj-Varjú, Benedikt Löwe, Klaus Ambos-Spies, 2013, J. Log. Comput..

Minimal Pairs and Complete Problems

Robert I. Soare, Klaus Ambos-Spies, Steven Homer, 1994, Theor. Comput. Sci..

Automorphism bases for the recursively enumerable degrees

Klaus Ambos-Spies, 2018, Comput..

Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice

Benedikt Löwe, Wolfgang Merkle, Klaus Ambos-Spies, 2009 .

Diagonalizing over Deterministic Polynomial Time

Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig, 1987, CSL.

The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable

Klaus Ambos-Spies, André Nies, 1992, STACS.

Genericity and Measure for Exponential Time

Sebastiaan Terwijn, Klaus Ambos-Spies, Hans-Christian Neis, 1996, Theor. Comput. Sci..

The Continuity of Cupping to 0'

Alistair H. Lachlan, Robert I. Soare, Klaus Ambos-Spies, 1993, Ann. Pure Appl. Log..

Problems with Cannot Be Reduced to Any Proper Subproblems

Klaus Ambos-Spies, 2003, MFCS.

The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability

André Nies, Richard A. Shore, Klaus Ambos-Spies, 1992, J. Symb. Log..

Cupping and noncapping in the r.e. weak truth table and turing degrees

Klaus Ambos-Spies, K. Ambos-Spies, 1985, Arch. Math. Log..

Computational Aspects of Disjunctive Sequences

Klaus Ambos-Spies, Edgar Busse, 2004, MFCS.

Minimal Pairs and Complete Problems

Robert I. Soare, Klaus Ambos-Spies, Steven Homer, 1990, STACS.

Almost Complete Sets

Sebastiaan Terwijn, Wolfgang Merkle, Klaus Ambos-Spies, 2000, STACS.

Randomness in Computability Theory

Klaus Ambos-Spies, Antonín Kučera, A. Kucera, 2000 .

On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems

Klaus Ambos-Spies, 1989, Theor. Comput. Sci..

On Disjunctive Self-Reducibility

Klaus Ambos-Spies, Jürgen Kämper, 1988, CSL.

Degree Theoretical Splitting Properties of Recursively Enumerable Sets

Klaus Ambos-Spies, Peter A. Fejer, 1988, J. Symb. Log..

Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

Manuel Lerman, Steffen Lempp, Klaus Ambos-Spies, 1996, Journal of Symbolic Logic.

Comparing DNR and WWKL

Steffen Lempp, Bjørn Kjos-Hanssen, Theodore A. Slaman, 2004, J. Symb. Log..

Diagonalizations over Polynomial Time Computable Sets

Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig, 1987, Theor. Comput. Sci..

2011 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '11

Klaus Ambos-Spies, K. Ambos-Spies, 2012, The Bulletin of Symbolic Logic.

Lattice embeddings into the recursively enumerable degrees

Manuel Lerman, Klaus Ambos-Spies, M. Lerman, 1986, Journal of Symbolic Logic.

A Note on the Complete Problems for Complexity Classes

Klaus Ambos-Spies, 1986, Inf. Process. Lett..

The Recursively Enumerable Degrees have Infinitely Many One-Types

Robert I. Soare, Klaus Ambos-Spies, 1989, Ann. Pure Appl. Log..

On the Structure of Polynomial Time Degrees

Klaus Ambos-Spies, 1984, STACS.

On the strongly bounded turing degrees of simple sets

Klaus Ambos-Spies, 2014, Logic, Computation, Hierarchies.

Learning Finite Variants of Single Languages from Informant

Klaus Ambos-Spies, 2016, ALT.

Separating NP-Completeness Notions under Strong Hypotheses

Klaus Ambos-Spies, Levke Bentzien, 2000, J. Comput. Syst. Sci..

Resource Bounded Randomness and Weakly Complete Problems

Sebastiaan Terwijn, Klaus Ambos-Spies, Xizhong Zheng, 1997, Theor. Comput. Sci..

Measure Theoretic Completeness Notions for the Exponential Time Classes

Klaus Ambos-Spies, 2000, MFCS.

Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness

Yongge Wang, Klaus Ambos-Spies, Elvira Mayordomo, 1996, STACS.

Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings

Benedikt Löwe, Wolfgang Merkle, Klaus Ambos-Spies, 2009, CiE.

Inductive inference and computable numberings

Klaus Ambos-Spies, Serikzhan A. Badaev, Sergey Goncharov, 2011, Theor. Comput. Sci..

P-Generic Sets

Klaus Ambos-Spies, 1984, ICALP.

Bounding non-GL2 and R.E.A.

Wei Wang, Liang Yu, Klaus Ambos-Spies, 2009, The Journal of Symbolic Logic.

Inhomogeneities in the Polynomial-Time Degrees: The Degrees of Super Sparse Sets

Klaus Ambos-Spies, 1986, Inf. Process. Lett..

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees

Klaus Ambos-Spies, Decheng Ding, 1994, Math. Log. Q..

Structure and Complexity Theory (Dagstuhl Seminar 9206)

Uwe Schöning, Klaus Ambos-Spies, Steven Homer, 2021 .

Some Observations on Mitotic Sets

Klaus Ambos-Spies, 2021, Logic, Computation and Rigorous Methods.

ON SUPERSETS OF NON-LOW $_2$ SETS

Klaus Ambos-Spies, Martin Monath, Rodney G. Downey, 2021, The Journal of Symbolic Logic.

Structure and Complexity (Dagstuhl Seminar 9407)

Uwe Schöning, Klaus Ambos-Spies, Steven Homer, 2021 .

Lattice embeddings into the R.E. Degrees preserving 1

Manuel Lerman, Steffen Lempp, Klaus Ambos-Spies, 1995 .

Complexity theory: current research

Uwe Schöning, Klaus Ambos-Spies, Steven Homer, 1993 .

Contiguous R.E. Degrees

Klaus Ambos-Spies, K. Ambos-Spies, 1984 .

Effective Baire Category Concepts

Klaus Ambos-Spies, Jan Reimann, K. Ambos-Spies, 1998 .

Generators of the recursively enumerable degrees

Klaus Ambos-Spies, 1985 .

A Uniform Circuit Lower Bound for the Permanent

Uwe Schöning, Klaus Ambos-Spies, Steven Homer, 2012 .

Lattice Embeddings into the R.E. Degrees Preserving 0 and 1

Manuel Lerman, Steffen Lempp, Klaus Ambos-Spies, 1994 .

An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees

Robert I. Soare, Carl G. Jockusch, Richard A. Shore, 1984 .

On pairs of recursively enumerable degrees

Klaus Ambos-Spies, 1984 .