Weak completeness notions for exponential time

Authors:
Klaus Ambos-Spies;Timur Bakibayev
Affiliations:
University of Heidelberg, Institut für Informatik, Heidelberg, Germany;University of Heidelberg, Institut für Informatik, Heidelberg, Germany
Venue:
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Year:
2010

Citing 19
Cited 1

A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees

4th Annual Symposium on Theoretical Aspects of Computer Sciences on STACS 87
Minimal pairs for polynomial time reducibilities

Computation theory and logic
A comparison of polynomial time completeness notions

Theoretical Computer Science
Structural complexity 2

Structural complexity 2
Category and measure in complexity classes

SIAM Journal on Computing
Almost everywhere high nonuniform complexity

Journal of Computer and System Sciences
Weak completeness in E and E2

Theoretical Computer Science
The Complexity and Distribution of Hard Problems

SIAM Journal on Computing
Almost every set in exponential time is P-bi-immune

Theoretical Computer Science
Weakly Hard Problems

SIAM Journal on Computing
Resource-bounded genericity

Computability, enumerability, unsolvability
Genericity and measure for exponential time

MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
Resource bounded randomness and weakly complete problems

Theoretical Computer Science
An excursion to the Kolmogorov random strings

Journal of Computer and System Sciences - special issue on complexity theory
An introduction to Kolmogorov complexity and its applications (2nd ed.)

An introduction to Kolmogorov complexity and its applications (2nd ed.)
The quantitative structure of exponential time

Complexity theory retrospective II
On the Structure of Polynomial Time Reducibility

Journal of the ACM (JACM)
A Comparison of Weak Completeness Notions

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Nontriviality for exponential time w.r.t weak reducibilities

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation

Nontriviality for exponential time w.r.t. weak reducibilities

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Lutz [20] proposed the following generalization of hardness: While a problem A is hard for a complexity class C if all problems in C can be reduced to A, Lutz calls a problem weakly hard if a nonnegligible part of the problems in C can be reduced to A. For the exponential-time class E, Lutz formalized these ideas by introducing a resource-bounded (pseudo) measure on this class and by saying that a subclass of E is negligible if it has measure 0 in E. Here we introduce and investigate new weak hardness notions for E, called E-nontriviality and strong E-nontriviality, which generalize Lutz's weak hardness notion for E and which are conceptually much simpler than Lutz's concept. Moreover, E-nontriviality may be viewed as the most general consistent weak hardness notion for E.