scientific article; zbMATH DE number 841081

From MaRDI portal

Revision as of 04:00, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4863237

Jump to:navigation, search

zbMath0844.03022MaRDI QIDQ4863237

Ambos-Spies, Klaus

Publication date: 4 February 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

diagonalization polynomial time generic sets co-meager set

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15)

Related Items (9)

Bounded truth table does not reduce the one-query tautologies to a random oracle ⋮ Resource bounded randomness and weakly complete problems ⋮ An oracle builder's toolkit ⋮ Comparing nontriviality for E and EXP ⋮ Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998 ⋮ Genericity and randomness over feasible probability measures ⋮ Weak completeness notions for exponential time ⋮ Resource-bounded strong dimension versus resource-bounded category ⋮ Degrees of Dowd-type generic oracles

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4863237&oldid=19216948"