1226 search results - page 42 / 246 » Proofs, Programs and Abstract Complexity |
143
click to vote
SAS
1995
Springer
15 years 6 months ago
1995
Springer
ntation in Abstract Interpretation AGOSTINO CORTESI Universit`a di Venezia GILBERTO FIL´E Universit`a di Padova ROBERTO GIACOBAZZI Universit`a di Pisa CATUSCIA PALAMIDESSI Univers...
159
click to vote
TYPES
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. In the FTA project in Nijmegen we have formalized a constructive proof of the Fundamental Theorem of Algebra. In the formalization, we have first defined the (constructiv...
103
Voted
STOC
2010
ACM
16 years 11 hour ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
113
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract--Effective complexity measures the information content of the regularities of an object. It has been introduced by M. Gell-Mann and S. Lloyd to avoid some of the disadvant...
143
Voted
MFCS
1995
Springer
15 years 6 months ago
1995
Springer
act Account of Composition Mart n Abadi1 and Stephan Merz2 1 Digital Equipment Corporation, Systems Research Center, 130 Lytton Avenue, Palo Alto, CA 94301, U.S.A. 2 Institut fur I...