Sciweavers

208 search results - page 15 / 42
» Arithmetic Operations in the Polynomial Modular Number Syste...
Sort
View
ISDA
2006
IEEE
14 years 1 months ago
Efficient Multiplier over Finite Field Represented in Type II Optimal Normal Basis
- Elliptic curve cryptography plays a crucial role in networking and information security area, and modular multiplication arithmetic over finite field is a necessary computation p...
Youbo Wang, Zhiguang Tian, Xinyan Bi, Zhendong Niu
ARITH
2009
IEEE
14 years 2 months ago
Fully Redundant Decimal Arithmetic
Hardware implementation of all the basic radix-10 arithmetic operations is evolving as a new trend in the design and implementation of general purpose digital processors. Redundan...
Saeid Gorgin, Ghassem Jaberipur
GECCO
2010
Springer
169views Optimization» more  GECCO 2010»
13 years 11 months ago
Robust symbolic regression with affine arithmetic
We use affine arithmetic to improve both the performance and the robustness of genetic programming for symbolic regression. During evolution, we use affine arithmetic to analyze e...
Cassio Pennachin, Moshe Looks, João A. de V...
CORR
2010
Springer
69views Education» more  CORR 2010»
13 years 7 months ago
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
Guillaume Chèze
FOCS
2009
IEEE
14 years 2 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson