Title :
E-mail and the unexpected power of interaction
Author_Institution :
Eotvos Univ., Budapest, Hungary
Abstract :
The LFKN protocol, interactive proofs, complexity classes, relativized separation, arithmetization of Boolean formulas, program verification, multiple provers, circuit reductions and publishable proofs, and space-bounded interactive proofs are discussed. An examination is also made of e-mail ethics
Keywords :
computational complexity; electronic mail; Boolean formulas; LFKN protocol; arithmetization; circuit reductions; complexity classes; e-mail ethics; interaction; interactive proofs; multiple provers; program verification; publishable proofs; relativized separation; space-bounded interactive proofs; Bipartite graph; Electronic mail; Ethics; Heart; Interpolation; Leg; Polynomials; Technological innovation;
Conference_Titel :
Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual
Conference_Location :
Barcelona
Print_ISBN :
0-8186-6072-4
DOI :
10.1109/SCT.1990.113952
