1410 search results - page 52 / 282 » Proving theorems by reuse |
ECCC
2006
13 years 10 months ago
2006
In this paper we ask the question whether the extended Frege proof system EF satisfies a weak version of the deduction theorem. We prove that if this is the case, then complete dis...
COMBINATORICS
2004
13 years 9 months ago
2004
The Sandwich Theorems proved in this paper give a new method to show that the partition function a(n) of a partition identity A(x) := n=0 a(n)xn = n=1 (1 - xn )-p(n) satisfies t...
COMBINATORICS
2000
13 years 9 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
IWPC
2006
IEEE
14 years 4 months ago
2006
IEEE
Program componentization has been proved to be an effective way to increase the speed and cost-effectiveness of reusing, maintaining, and understanding existing software systems. ...
PATMOS
2000
Springer
14 years 1 months ago
2000
Springer
Exploitation of data re-use in combination with the use of custom memory hierarchy that exploits the temporal locality of data accesses may introduce significant power savings, esp...