1322 search results - page 145 / 265 » Unsound Theorem Proving |
COCOON
2008
Springer
13 years 12 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...
FLOPS
2008
Springer
13 years 11 months ago
2008
Springer
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
ALGORITHMICA
2006
13 years 10 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...
FCSC
2008
13 years 10 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...
JCT
2006
13 years 10 months ago
2006
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...