Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds.

Gilles Brassard Claude Crépeau Moti Yung

Published in: ICALP (1989)

Keyphrases

computational complexity
domain knowledge
np complete
prior knowledge
database
search engine
knowledge base
decision trees
knowledge acquisition
evolutionary algorithm
truth table
fixed number
small number
knowledge representation
bayesian networks
similarity measure
high level
information retrieval
real time