Shorter arithmetization of nondeterministic computations

نویسندگان

  • Alessandro Chiesa
  • Zeyuan Allen Zhu
چکیده

Arithmetizing computation is a crucial component of many fundamental results in complexity theory, including results that gave insight into the power of interactive proofs, multi-prover interactive proofs, and probabilistically-checkable proofs. Informally, an arithmetization is a way to encode a machine’s computation so that its correctness can be easily verified via few probabilistic algebraic checks. We study the problem of arithmetizing nondeterministic computations for the purpose of constructing short probabilistically-checkable proofs (PCPs) with polylogarithmic query complexity. In such a setting, a PCP’s proof length depends (at least!) linearly on the length, in bits, of the encoded computation. Thus, minimizing the number of bits in the encoding is crucial for minimizing PCP proof length. In this paper we show how to arithmetize any T -step computation on a nondeterministic Turing machine by using a polynomial encoding of length O ( T · (log T ) ) . Previously, the best known length was Ω(T · (log T )). For nondeterministic random-access machines, our length is O(T · (log T )), while prior work only achieved Ω(T · (log T )). The polynomial encoding that we use is the Reed–Solomon code. When combined with the best PCPs of proximity for this code, our result yields quasilinear-size PCPs with polylogarithmic query complexity that are shorter, by at least two logarithmic factors, than in all prior work. Our arithmetization also enjoys additional properties. First, it is succinct, i.e., the encoding of the computation can be probabilistically checked in (log T ) time; this property is necessary for constructing short PCPs with a polylogarithmic-time verifier. Furthermore, our techniques extend, in a certain well-defined sense, to the arithmetization of yet other NEXP-complete languages.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Logic Automata

A Linear Logic automaton is a hybrid of a finite automaton and a non-deterministic Petri net. LL automata commands are represented by propositional Horn Linear Logic formulas. Computations performed by LL automata directly correspond to cut-free derivations in Linear Logic. A programming language of LL automata is developed in which typical sequential, nondeterministic and parallel programming ...

متن کامل

Quantifying Nondeterminism in Finite Automata

Various ways of quantifying the nondeterminism in finite automata have been considered since the 1970’s. Roughly speaking, a nondeterminism measure can count the number of accepting computations (ambiguity), the number of all computations (computation width) or the amount of nondeterminism on a single best (or worst) computation on a given input. This paper surveys results on the growth rate of...

متن کامل

Parallelizing NP-Complete Problems Using Tree Shaped Computations

We explain how the parallelization aspects of a large class of applications can be modeled as tree shaped computations. This model is particularly suited for NP-complete problems. One reason for this is that any computation on a nondeterministic machine can be emulated on a deterministic machine using a tree shaped computation. We then proceed to a particular example, the knapsack problem It tu...

متن کامل

Efficient Algorithms for Handling Nondeterministic Automata

Finite (word, tree, or omega) automata play an important role in different areas of computer science, including, for instance, formal verification. Often, deterministic automata are used for which traditional algorithms for important operations such as minimisation and inclusion checking are available. However, the use of deterministic automata implies a need to determinise nondeterministic aut...

متن کامل

Nondeterministic Finite Automata

This is an example of what is called a nondeterministic finite automaton (NFA). Intuitvely, such a machine could have many possible computations on a given input. For example, on an input of the form u001v, it is possible for the machine to reach the accepting state qp by transitioning from q to q0 after reading u. Similarly, it is possible for the machine to reach qp also on the input u01v — f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Theor. Comput. Sci.

دوره 600  شماره 

صفحات  -

تاریخ انتشار 2015