DocumentCode
2775019
Title
Algebraic methods for interactive proof systems
Author
Lund, Carsten ; Fortnow, Lance ; Karloff, Howard ; Nisan, Noam
Author_Institution
Chicago Univ., IL, USA
fYear
1990
fDate
22-24 Oct 1990
Firstpage
2
Abstract
An algebraic technique for the construction of interactive proof systems is proposed. The technique is used to prove that every language in the polynomial-time hierarchy has an interactive proof system. For the proof, a method is developed for reducing the problem of verifying the value of a low-degree polynomial at two points to verifying the value at one new point. The results have implications for program checking, verification, and self-correction
Keywords
computational complexity; formal languages; interactive systems; polynomials; program verification; programming theory; protocols; theorem proving; algebraic technique; interactive proof systems; language; low-degree polynomial; polynomial value verification; polynomial-time hierarchy; program checking; program self correction; program verification; Context; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-2082-X
Type
conf
DOI
10.1109/FSCS.1990.89518
Filename
89518
Link To Document