Sciweavers

257 search results - page 2 / 52
» On the Complexity of Computing Units in a Number Field
Sort
View
MOC
2000
111views more  MOC 2000»
13 years 5 months ago
Voronoi's algorithm in purely cubic congruence function fields of unit rank 1
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
Renate Scheidler, Andreas Stein
EUROGRAPHICS
2010
Eurographics
13 years 6 months ago
Scalable Height Field Self-Shadowing
We present a new method suitable for general purpose graphics processing units to render self-shadows on dynamic height fields under dynamic light environments in real-time. Visib...
Ville Timonen and Jan Westerholm
ANTS
2000
Springer
87views Algorithms» more  ANTS 2000»
13 years 9 months ago
Reduction in Purely Cubic Function Fields of Unit Rank One
This paper analyzes reduction of fractional ideals in a purely cubic function field of unit rank one. The algorithm is used for generating all the reduced principal fractional ide...
Renate Scheidler
MOC
2000
84views more  MOC 2000»
13 years 5 months ago
Solving Thue equations without the full unit group
Abstract. The main problem when solving a Thue equation is the computation of the unit group of a certain number field. In this paper we show that the knowledge of a subgroup of fi...
Guillaume Hanrot
ARITH
2009
IEEE
14 years 8 days ago
A Dual-Purpose Real/Complex Logarithmic Number System ALU
—The real Logarithmic Number System (LNS) allows fast and inexpensive multiplication and division but more expensive addition and subtraction as precision increases. Recent advan...
Mark G. Arnold, Sylvain Collange