352 search results - page 6 / 71 » Proofs as Polynomials |
FOCS
1990
IEEE
15 years 2 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
IJCAI
1993
14 years 11 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
SAC
2006
ACM
15 years 4 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ï¬...
CSL
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. For a reasonable sound and complete proof calculus for firstorder logic consider the problem to decide, given a sentence of firstorder logic and a natural number n, whet...
ECCC
2010
14 years 10 months ago
2010
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show t...