Sciweavers

210 search results - page 2 / 42
» Widening Integer Arithmetic
Sort
View
CC
2005
Springer
103views System Software» more  CC 2005»
13 years 5 months ago
Valiant's model and the cost of computing integers
Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...
Pascal Koiran
CSCLP
2003
Springer
13 years 10 months ago
A Comparative Study of Arithmetic Constraints on Integer Intervals
Abstract. We propose here a number of approaches to implement constraint propagation for arithmetic constraints on integer intervals. To this end we introduce integer interval arit...
Krzysztof R. Apt, Peter Zoeteweij
CIE
2009
Springer
13 years 9 months ago
Functions Definable by Arithmetic Circuits
An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this pap...
Ian Pratt-Hartmann, Ivo Düntsch
SPIN
2012
Springer
11 years 7 months ago
SMTInterpol: An Interpolating SMT Solver
Abstract. Craig interpolation is an active research topic and has become a powerful technique in verification. We present SMTInterpol, an interpolating SMT solver for the quanti...
Jürgen Christ, Jochen Hoenicke, Alexander Nut...
CORR
2008
Springer
111views Education» more  CORR 2008»
13 years 5 months ago
Fast Integer Multiplication using Modular Arithmetic
We give an O(N
Anindya De, Piyush P. Kurur, Chandan Saha, Rampras...