713 search results - page 29 / 143 » Saving Space by Algebraization |
ASIACRYPT
2004
Springer
15 years 3 months ago
2004
Springer
The “XL-algorithm” is a computational method to solve overdetermined systems of polynomial equations which is based on a generalization of the well-known method of linearizatio...
ESA
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We show that all algebraic-geometric codes possess a succinct representation that allows for the list decoding algorithms of [15, 7] to run in polynomial time. We do this...
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
Abstract. The paper deals with the question of recognizing the mutual positions of the connected components of a non-singular real projective surface S in the real projective 3-spa...
SODA
2012
ACM
13 years 9 days ago
2012
ACM
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
ACS
2004
14 years 9 months ago
2004
One of the best ways of studying ordered algebraic structures is through their spectra. The three well-known spectra usually considered are the Brumfiel, Keimel, and the maximal sp...