DocumentCode
2891617
Title
Quantifying knowledge complexity
Author
Goldreich, Oded ; Petrank, Erez
Author_Institution
Dept. of Comput. Sci., Technion-Israel Inst. of Technol., Haifa, Israel
fYear
1991
fDate
1-4 Oct 1991
Firstpage
59
Lastpage
68
Abstract
Several alternative ways of defining knowledge complexity are presented, and the relationships between them are explored. The discussion covers inclusion results, separation results, properties of knowledge complexity of languages in the Hint sense, and the knowledge complexity of constant round AM proofs
Keywords
computational complexity; theorem proving; Hint sense; computational complexity; constant round AM proofs; inclusion results; knowledge complexity; languages; proof system; separation results; Complexity theory; Computer science; Gain measurement; Natural languages; Polynomials; Probability distribution; Protocols;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1991. Proceedings., 32nd Annual Symposium on
Conference_Location
San Juan
Print_ISBN
0-8186-2445-0
Type
conf
DOI
10.1109/SFCS.1991.185349
Filename
185349
Link To Document