16 search results - page 3 / 4 » Practical Divide-and-Conquer Algorithms for Polynomial Arith... |
SODA
2003
ACM
13 years 6 months ago
2003
ACM
This work examines algebraic techniques for comparing quadratic algebraic numbers, thus yielding methods for deciding key predicates in various geometric constructions. Our motiva...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract: This paper addresses the problem of equivalence veriļ¬cation of RTL descriptions that implement arithmetic computations (add, mult, shift) over bitvectors that have diļ¬...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
The Lenstra-Lenstra-LovĀ“asz lattice basis reduction algorithm (LLL or L3 ) is a very popular tool in public-key cryptanalysis and in many other ļ¬elds. Given an integer d-dimensi...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient ļ¬ow of a ārepulsiveā energy function. This algor...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...