1410 search results - page 149 / 282 » Proving theorems by reuse |
202
Voted
SODA
2012
ACM
13 years 8 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
176
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
161
click to vote
CADE
2005
Springer
16 years 6 months ago
2005
Springer
Abstract This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover using nominal techniques. Central to the formalisation is an inductive set that i...
145
click to vote
CIE
2009
Springer
16 years 19 days ago
2009
Springer
We introduce the parameter cutwidth for the Cutting Planes (CP) system of Gomory and Chv´atal. We provide linear lower bounds on cutwidth for two simple polytopes. Considering CP ...
184
click to vote
CISC
2007
Springer
16 years 7 days ago
2007
Springer
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...