Interactive Proofs and the Hardness of Approximating Cliques.

Uriel Feige Shafi Goldwasser László Lovász Shmuel Safra Mario Szegedy

Published in: J. ACM (1996)

Keyphrases

computational complexity
user friendly
computer graphics
data sets
virtual reality
user interaction
genetic algorithm
neural network
phase transition
maximal cliques
e learning
higher order
information retrieval
real time
learning theory
data visualization
theorem proving
np hardness
interactive video