Weak Completeness Notions for Exponential Time

DOI10.1007/978-3-642-14165-2_43zbMath1288.68077OpenAlexW1572133473MaRDI QIDQ3587403

Timur Bakibayev, Ambos-Spies, Klaus

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: http://archiv.ub.uni-heidelberg.de/volltextserver/10499/1/thesis.pdf

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)

Related Items (3)

Nontriviality for exponential time w.r.t. weak reducibilities ⋮ Comparing nontriviality for E and EXP ⋮ Weak completeness notions for exponential time

This page was built for publication: Weak Completeness Notions for Exponential Time