Comparing nontriviality for E and EXP

DOI10.1007/S00224-011-9370-3zbMATH Open1253.68137OpenAlexW1983486272MaRDI QIDQ693048FDOQ693048

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Almost everywhere high nonuniform complexity
• Measure, Stochasticity, and the Density of Hard Languages
• Weak completeness in \(\text{E}\) and \(\text{E}_{2}\)
• Title not available (Why is that?)
• Resource bounded randomness and weakly complete problems
• Weak completeness notions for exponential time
• Title not available (Why is that?)
• Weakly Hard Problems
• Quantitative aspects of speed-up and gap phenomena
• Title not available (Why is that?)

Cited In (3)

• Nontriviality for exponential time w.r.t. weak reducibilities
• Title not available (Why is that?)
• 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)