Low-Depth Witnesses are Easy to Find

Authors:
Luis Antunes;Lance Fortnow;Alexandre Pinto;Andre Souto
Affiliations:
U. Porto;U. Chicago;U. Porto;U. Porto
Venue:
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Year:
2007

Citing 0
Cited 3

Information measures for infinite sequences

Theoretical Computer Science
Kolmogorov complexity cores

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
On the optimal compression of sets in PSPACE

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

There exists a positive constant \alpha \le 1 such that for any function T(n)\leqslant n^{\alpha} and for any problem L \in BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time which decides L, except for at most a 2^{-\Omega ...