scientific article; zbMATH DE number 845602

MaRDI QIDQ4865619zbMATH OpenFDO

Authors Peter van Emde Boas

Publication date 1995

zbMATH Keywords

abstract complexity theorycomplexity classesnon-renameability theoremtotal functions

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 3980486
• scientific article; zbMATH DE number 512805
• Upper bound on the complexity of solving hard renaming
• Completeness problems in classes of computable named functions
• Effective category and measure in abstract complexity theory

Cited in

(1)

• scientific article; zbMATH DE number 3980486 (Why is no real title available?)

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