Sciweavers

2397 search results - page 4 / 480
» Applications of integer relation algorithms
Sort
View
CORR
2007
Springer
68views Education» more  CORR 2007»
13 years 9 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
ISAAC
2004
Springer
93views Algorithms» more  ISAAC 2004»
14 years 3 months ago
A Generalization of Magic Squares with Applications to Digital Halftoning
A semimagic square of order n is an n ¢n matrix containing the integers 0 n2  1 arranged in such a way that each row and column add up to the same value. We generalize this notio...
Boris Aronov, Tetsuo Asano, Yosuke Kikuchi, Subhas...
ISTCS
1995
Springer
14 years 1 months ago
Computation of Highly Regular Nearby Points
We call a vector x 2 IRn highly regular if it satis es < x m >= 0 for some short, non{zero integer vector m where < : : > is the inner product. We present an algorithm...
Carsten Rössner, Claus-Peter Schnorr
CHES
2005
Springer
155views Cryptology» more  CHES 2005»
14 years 3 months ago
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
Motivated by the goal of factoring large integers using the Number Field Sieve, several special-purpose hardware designs have been recently proposed for solving large sparse system...
Willi Geiselmann, Adi Shamir, Rainer Steinwandt, E...
4OR
2006
100views more  4OR 2006»
13 years 9 months ago
Nondecomposable solutions to group equations and an application to polyhedral combinatorics
This paper is based on the study of the set of nondecomposable integer solutions in a Gomory corner polyhedron, which was recently used in a reformulation method for integer linear...
Matthias Jach, Matthias Köppe, Robert Weisman...