scientific article; zbMATH DE number 841081
From MaRDI portal
zbMATH Open0844.03022MaRDI QIDQ4863237FDOQ4863237
Authors: Klaus Ambos-Spies 
Publication date: 4 February 1996
Title of this publication is not available (Why is that?)
Recommendations
Cited In (13)
- Title not available (Why is that?)
- Comparing nontriviality for E and EXP
- Degrees of Dowd-type generic oracles
- Genericity and randomness over feasible probability measures
- Bounded truth table does not reduce the one-query tautologies to a random oracle
- Resource-bounded strong dimension versus resource-bounded category
- An oracle builder's toolkit
- Weak completeness notions for exponential time
- Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998
- Diagonalizations over polynomial time computable sets
- Dynamic notions of genericity and array noncomputability
- Finite-state genericity. On the diagonalization strength of finite automata.
- Resource bounded randomness and weakly complete problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863237)
