scientific article; zbMATH DE number 3987265

MaRDI QIDQ3751568zbMATH OpenFDO

Authors Hans Fleischhack

Publication date 1986

zbMATH Keywords

oraclerecursive sets\(P=NP\) problemp-generic setsnp-genericity

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3885884
• Diagonalizations over polynomial time computable sets
• Relativized generic classes P and NP
• Genericity and measure for exponential time (extended abstract)
• scientific article; zbMATH DE number 62443

Cited in

(4)

• Genericity and measure for exponential time
• scientific article; zbMATH DE number 3885884 (Why is no real title available?)
• Genericity and measure for exponential time (extended abstract)
• Diagonalizations over polynomial time computable sets

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