Hardness Hypotheses, Derandomization, and Circuit Complexity.

John M. Hitchcock Aduri Pavan

Published in: FSTTCS (2004)

Keyphrases

computational complexity
worst case
np hardness
high speed
computational cost
image sequences
np hard
constraint satisfaction
hypothesis testing
data sets
artificial intelligence
objective function
video sequences
information theoretic
memory requirements
phase transition