Comparing nontriviality for E and EXP

DOI10.1007/S00224-011-9370-3MaRDI QIDQ693048zbMATHOpenAlexFDO

Authors Timur Bakibayev, Klaus Ambos-Spies

Publication date 7 December 2012

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00224-011-9370-3

zbMATH Keywords

completenessexponential timelinear-exponential-time classpolynomial-exponential-time classpolynomial-time reducibilitiesweak completeness

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Nontriviality for Exponential Time w.r.t. Weak Reducibilities
• Nontriviality for exponential time w.r.t. weak reducibilities
• Weak completeness notions for exponential time
• With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets
• Weak completeness notions for exponential time

Cites work

• scientific article; zbMATH DE number 46423 (Why is no real title available?)
• scientific article; zbMATH DE number 192916 (Why is no real title available?)
• scientific article; zbMATH DE number 1048036 (Why is no real title available?)
• scientific article; zbMATH DE number 1072536 (Why is no real title available?)
• scientific article; zbMATH DE number 841081 (Why is no real title available?)
• Almost everywhere high nonuniform complexity
• Measure, Stochasticity, and the Density of Hard Languages
• Quantitative aspects of speed-up and gap phenomena
• Resource bounded randomness and weakly complete problems
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• Weak completeness notions for exponential time
• Weakly Hard Problems

Cited in

(3)

• Nontriviality for exponential time w.r.t. weak reducibilities
• scientific article; zbMATH DE number 5524182 (Why is no real title available?)
• Weak completeness notions for exponential time

This page was built for publication: Comparing nontriviality for E and EXP

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