scientific article; zbMATH DE number 4121422

MaRDI QIDQ4734760zbMATH OpenFDO

Authors Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig

Publication date 1988

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Diagonalizations over polynomial time computable sets
• scientific article; zbMATH DE number 3885884
• scientific article; zbMATH DE number 3988707
• scientific article; zbMATH DE number 3841832
• scientific article; zbMATH DE number 1860655

Cited in

(17)

• Diagonalizations over polynomial time computable sets
• Genericity and randomness over feasible probability measures
• Genericity and measure for exponential time
• Index sets and presentations of complexity classes
• Resource bounded randomness and weakly complete problems
• Resource-bounded martingales and computable Dowd-type generic sets
• Feasible analysis, randomness, and base invariance
• Resource bounded immunity and simplicity
• scientific article; zbMATH DE number 3841832 (Why is no real title available?)
• scientific article; zbMATH DE number 3988707 (Why is no real title available?)
• scientific article; zbMATH DE number 1507040 (Why is no real title available?)
• scientific article; zbMATH DE number 1860655 (Why is no real title available?)
• Diagonalization in proof complexity
• Genericity and measure for exponential time (extended abstract)
• The Complexity of the Diagonal Problem for Recursion Schemes
• Special issue: 17th ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, Seattle, WA, USA, June 1--3, 1998
• Immunity and pseudorandomness of context-free languages

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 Q4734760)