High confidence in floating-point programs requires proving numerical properties of final and intermediate values. One may need to guarantee that a value stays within some range, ...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Abstract. We know that tilesets that can tile the plane always admit a quasiperiodic tiling [4, 8], yet they hold many uncomputable properties [3, 11, 21, 25]. The quasi-periodicit...