Arithmetization: A New Method In Structural Complexity Theory

Arithmetization: A New Method In Structural Complexity Theory (1991)

by László Babai , Lance Fortnow

Citations:

44 - 9 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Arithmetization: A New Method In Structural Complexity Theory	user correction - Legacy Corrections
AUTHOR NAME	László Babai	user correction - Legacy Corrections
AUTHOR NAME	Lance Fortnow	user correction - Legacy Corrections
AUTHOR AFFIL	]P	user correction - Legacy Corrections
ABSTRACT	. We introduce a technique of arithmetization of the process of computation in order to obtain novel characterizations of certain complexity classes via multivariate polynomials. A variety of concepts and tools of elementary algebra, such as the degree of polynomials and interpolation, becomes thereby available for the study of complexity classes. The theory to be described provides a unified framework from which powerful recent results follow naturally. The central result is a characterization of ]P in terms of arithmetic straight line programs. The consequences include a simplified proof of Toda's Theorem that PH ` P ]P ; and an infinite class of natural and potentially inequivalent functions, checkable in the sense of Blum et al. Similar characterizations of PSPACE are also given. The arithmetization technique was independently discovered by Adi Shamir. While this simultaneous discovery was driven by applications to interactive proofs, the present paper demonstrates the applicabil...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	30 found	ParsCit 1.0