Structural properties of complete problems for exponential time

MaRDI QIDQ4359459zbMATH OpenFDO

Authors S. Homer

Publication date 8 October 1997

zbMATH Keywords

exponential-time classes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1222922
• Weak completeness notions for exponential time
• Complete Problems and Strong Polynomial Reducibilities
• Exponential-time and subexponential-time sets

Cited in

(17)

• Non-mitotic sets
• Exponential-time and subexponential-time sets
• QUIXO is EXPTIME-complete
• Cops and robbers is EXPTIME-complete
• Query-monotonic Turing reductions
• Partial bi-immunity, scaled dimension, and NP-completeness
• Nontriviality for Exponential Time w.r.t. Weak Reducibilities
• scientific article; zbMATH DE number 4047100 (Why is no real title available?)
• Nontriviality for exponential time w.r.t. weak reducibilities
• scientific article; zbMATH DE number 17551 (Why is no real title available?)
• scientific article; zbMATH DE number 176522 (Why is no real title available?)
• scientific article; zbMATH DE number 1222922 (Why is no real title available?)
• scientific article; zbMATH DE number 512826 (Why is no real title available?)
• scientific article; zbMATH DE number 1962844 (Why is no real title available?)
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• Non-mitotic Sets
• Comparing reductions to NP-complete sets

This page was built for publication: Structural properties of complete problems for exponential time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4359459)