81 search results - page 13 / 17 » Rewrite Systems for Integer Arithmetic |
IJNSEC
2010
13 years 2 months ago
2010
Most public key crypto systems use finite field modulo arithmetic. This modulo arithmetic is applied on real numbers, binary values and polynomial functions. The computation cost ...
SIAMCOMP
2000
13 years 7 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
SIAMDM
2010
13 years 5 months ago
2010
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
JCT
2010
13 years 5 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
TACAS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...