1410 search results - page 142 / 282 » Proving theorems by reuse |
189
click to vote
FSTTCS
1991
Springer
15 years 9 months ago
1991
Springer
This paper closes a gap in the foundations of the theory of average case complexity. First, we clarify the notion of a feasible solution for a search problem and prove its robustne...
152
click to vote
ASM
2008
ASM
15 years 8 months ago
2008
ASM
As systems become ever more complex, verification becomes more main stream. Event-B and Alloy are two formal specification languages based on fairly different methodologies. While...
125
click to vote
COCOON
2008
Springer
15 years 7 months ago
2008
Springer
A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2n colors such that any hyperbox has all the colors...
184
click to vote
ALGORITHMICA
2006
15 years 6 months ago
2006
Abstract. In this paper we prove the optimality and other properties of the -adic nonadjacent form: this expansion has been introduced in order to efficiently compute scalar multip...
173
click to vote
FCSC
2008
15 years 6 months ago
2008
We present a computing environment for origami on the web. The environment consists of the computational origami engine Eos for origami construction, visualization, and geometrical...