The following pages link to Ambos-Spies, Klaus (Q162061):
Displaying 45 items.
- (Q171911) (redirect page) (← links)
- Nontriviality for exponential time w.r.t. weak reducibilities (Q391074) (← links)
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- Comparing nontriviality for E and EXP (Q693048) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets (Q1075319) (← links)
- A note on complete problems for complexity classes (Q1097029) (← links)
- Diagonalizations over polynomial time computable sets (Q1107526) (← links)
- On the relative complexity of hard problems for complexity classes without complete problems (Q1112017) (← links)
- Initial segments of recursive linear orders (Q1267600) (← links)
- Cappable recursively enumerable degrees and Post's program (Q1311427) (← links)
- The continuity of cupping to \(\text \textbf{0}'\) (Q1314642) (← links)
- Minimal pairs and complete problems (Q1334663) (← links)
- Genericity and measure for exponential time (Q1350990) (← links)
- Resource bounded randomness and weakly complete problems (Q1392022) (← links)
- Almost complete sets. (Q1426448) (← links)
- Undecidability and 1-types in intervals of the computably enumerable degrees (Q1591201) (← links)
- Multiple permitting and array noncomputability (Q1670715) (← links)
- The recursively enumerable degrees have infinitely many one-types (Q1823931) (← links)
- The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent (Q1944337) (← links)
- Maximal pairs of computably enumerable sets in the computably Lipschitz degrees (Q1946505) (← links)
- Normalized information distance and the oscillation hierarchy (Q2051851) (← links)
- Some observations on mitotic sets (Q2115899) (← links)
- On the differences and sums of strongly computably enumerable real numbers (Q2179375) (← links)
- Numberings and learnability (Q2263108) (← links)
- Weak completeness notions for exponential time (Q2322715) (← links)
- Inductive inference and computable numberings (Q2430009) (← links)
- (Q2784776) (← links)
- Learning Finite Variants of Single Languages from Informant (Q2830274) (← links)
- On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets (Q2970980) (← links)
- Quantitative aspects of speed-up and gap phenomena (Q3060186) (← links)
- (Q3203013) (← links)
- (Q3220571) (← links)
- Sublattices of the polynomial time degrees (Q3220572) (← links)
- (Q3315501) (← links)
- (Q3315502) (← links)
- An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees (Q3325709) (← links)
- On Pairs of Recursively Enumerable Degrees (Q3328534) (← links)
- (Q3337457) (← links)
- (Q3337458) (← links)
- Bounding non-GL<sub>2</sub> and R.E.A. (Q3399188) (← links)
- ON SUPERSETS OF NON-LOW SETS (Q5015733) (← links)
- Comparing DNR and WWKL (Q5311768) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431301) (← links)
- Lowness properties for strong reducibilities and the computational power of maximal sets (Q6128323) (← links)
