Sciweavers

210 search results - page 33 / 42
» Widening Integer Arithmetic
Sort
View
SYNASC
2005
IEEE
117views Algorithms» more  SYNASC 2005»
14 years 1 months ago
Functional-Based Synthesis of Systolic Online Multipliers
— Systolic online algorithms for the multiplication of univariate polynomials and of multiple precision integers are synthesised using a novel method based on the following funct...
Tudor Jebelean, Laura Szakacs
ICALP
2010
Springer
14 years 6 days ago
Mean-Payoff Games and Propositional Proofs
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
Albert Atserias, Elitza N. Maneva
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
13 years 12 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
AUSAI
2006
Springer
13 years 11 months ago
Finite Domain Bounds Consistency Revisited
A widely adopted approach to solving constraint satisfaction problems combines systematic tree search with constraint propagation for pruning the search space. Constraint propagati...
Chiu Wo Choi, Warwick Harvey, J. H. M. Lee, Peter ...
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
13 years 8 months ago
Deterministic identity testing for multivariate polynomials
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Richard J. Lipton, Nisheeth K. Vishnoi