24 search results - page 2 / 5 » On solving sparse algebraic equations over finite fields |
COCO
2008
Springer
13 years 7 months ago
2008
Springer
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
CORR
2004
Springer
13 years 5 months ago
2004
Springer
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
CHES
2005
Springer
2005
Springer
Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization
13 years 11 months ago
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...
CORR
1998
Springer
13 years 5 months ago
1998
Springer
Abstract. Consider a system F of n polynomial equations in n unknowns, over an algebraically closed field of arbitrary characteristic. We present a fast method to find a point in...
ISBI
2004
IEEE
14 years 6 months ago
2004
IEEE
Surface data such as the segmented cortical surface of the human brain plays an important role in medical imaging. To increase the signal-to-noise ratio for data residing on the b...