224 search results - page 25 / 45 » A parallel repetition theorem |
TAPSOFT
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
FMOODS
2007
13 years 9 months ago
2007
In this paper we present a formalization of Abadi’s and Cardelli’s theory of objects in the interactive theorem prover Isabelle/HOL. Our motivation is to build a mechanized HOL...
CC
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present an algorithm for counting the irreducible components of a complex algebraic variety defined by a fixed number of polynomials encoded as straight-line programs ...
PDCN
2004
13 years 9 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
IPPS
2003
IEEE
14 years 29 days ago
2003
IEEE
We have developed a new algorithm that allows the exhaustive determination of words of up to 12 nucleotides in DNA sequences. It is fast enough as to be used at a genomic scale ru...