Title :
On Heuristic Time Hierarchies
Author :
Pervyshev, Konstantin
Author_Institution :
Univ. of California, San Diego
Abstract :
We study the existence of time hierarchies for heuristic algorithms. We prove that a time hierarchy exists for heuristic algorithms in such syntactic classes as NP and co-NP, and also in semantic classes AM and MA. Further, we present an alternative approach to proving time hierarchies for heuristic algorithms in BPP. This leads to a simpler proof than the one known before.
Keywords :
optimisation; probability; NP classes; heuristic algorithms; semantic classes; time hierarchies; Complexity theory; Computational complexity; Computational modeling; Computer science; Drives; Error correction; Game theory; Heuristic algorithms; Polynomials; Stress;
Conference_Titel :
Computational Complexity, 2007. CCC '07. Twenty-Second Annual IEEE Conference on
Conference_Location :
San Diego, CA
Print_ISBN :
0-7695-2780-9
DOI :
10.1109/CCC.2007.20
