118 search results - page 14 / 24 » A simple proof of Bazzi's theorem |
112
Voted
TPHOL
2005
IEEE
15 years 6 months ago
2005
IEEE
We describe a formalization of the elementary algebra, topology and analysis of finite-dimensional Euclidean space in the HOL Light theorem prover. (Euclidean space is RN with the...
EJC
2010
15 years 15 days ago
2010
In a recent paper, Amini et al. introduced a general framework to prove duality theorems between tree decompositions and their dual combinatorial object. They unify all known ad-h...
166
click to vote
PLPV
2011
ACM
14 years 3 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
106
click to vote
CAV
2001
Springer
15 years 5 months ago
2001
Springer
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...