Sciweavers

AAECC
2005
Springer
128views Algorithms» more  AAECC 2005»
13 years 11 months ago
The size-change principle and dependency pairs for termination of term rewriting
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
René Thiemann, Jürgen Giesl
AAECC
2005
Springer
131views Algorithms» more  AAECC 2005»
13 years 11 months ago
Noisy interpolation of sparse polynomials in finite fields
Abstract We consider a polynomial analogue of the hidden number problem introduced by Boneh andVenkatesan, namely the sparse polynomial noisy interpolation problem of recovering an...
Igor Shparlinski, Arne Winterhof
AAECC
2005
Springer
99views Algorithms» more  AAECC 2005»
13 years 11 months ago
Formulae for Arithmetic on Genus 2 Hyperelliptic Curves
The ideal class group of hyperelliptic curves can be used in cryptosystems based on the discrete logarithm problem. In this article we present explicit formulae to perform the gro...
Tanja Lange
AAECC
2005
Springer
114views Algorithms» more  AAECC 2005»
13 years 11 months ago
The adjacency graph of a real algebraic surface
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...
Elisabetta Fortuna, Patrizia M. Gianni, Domenico L...
AAECC
2005
Springer
104views Algorithms» more  AAECC 2005»
13 years 11 months ago
Isomorphism Classes of Picard Curves over Finite Fields
In this paper we determine the number of isomorphism classes of Picard curves, i.e., superelliptic curves y3 = f(x) of genus three, over finite fields of characteristic different f...
Jong Won Lee