scientific article; zbMATH DE number 1072532

zbMATH Open0880.68040MaRDI QIDQ4359459FDOQ4359459

S. Homer

Publication date: 8 October 1997

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

exponential-time classes

Mathematics Subject Classification ID

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

Cited In (15)

• Nontriviality for exponential time w.r.t. weak reducibilities
• Comparing reductions to NP-complete sets
• Cops and robbers is EXPTIME-complete
• Non-mitotic sets
• Non-mitotic Sets
• Exponential-time and subexponential-time sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partial bi-immunity, scaled dimension, and NP-completeness
• Query-monotonic Turing reductions
• Nontriviality for Exponential Time w.r.t. Weak Reducibilities
• The Descriptive Complexity of the Deterministic Exponential Time Hierarchy
• Title not available (Why is that?)
• QUIXO is EXPTIME-complete
• Title not available (Why is that?)

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