Sciweavers

1410 search results - page 30 / 282
» Proving theorems by reuse
Sort
View
TPHOL
2003
IEEE
14 years 3 months ago
Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover
Abstract. Model checking and theorem proving are two complementary approaches to formal verification. In this paper we show how binary decision diagram (BDD) based symbolic model ...
Hasan Amjad
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 8 months ago
Strong direct product theorems for quantum communication and query complexity
A strong direct product theorem (SDPT) states that solving n instances of a problem requires ˝.n/ times the resources for a single instance, even to achieve success probability 2 ...
Alexander A. Sherstov
AML
2007
77views more  AML 2007»
13 years 10 months ago
Complex analysis in subsystems of second order arithmetic
Abstract. This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in...
Keita Yokoyama
CSL
2001
Springer
14 years 2 months ago
An Existential Locality Theorem
We prove an existential version of Gaifman’s locality theorem and show how it can be applied algorithmically to evaluate existential first-order sentences in finite structures....
Martin Grohe, Stefan Wöhrle
DM
2000
91views more  DM 2000»
13 years 9 months ago
Three distance theorem and grid graph
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
Nicolas Chevallier