Hardness Amplification of Weakly Verifiable Puzzles.
Ran CanettiShai HaleviMichael SteinerPublished in: TCC (2005)
Keyphrases
- phase transition
- constraint satisfaction
- helmholtz principle
- learning theory
- sufficient conditions
- secret sharing
- np complete
- crossword puzzles
- worst case
- artificial intelligence
- information theoretic
- computational complexity
- information retrieval
- upper bound
- search space
- video sequences
- np hardness
- data mining
- database