Sciweavers

2087 search results - page 5 / 418
» Computation of class numbers of quadratic number fields
Sort
View
STOC
2001
ACM
143views Algorithms» more  STOC 2001»
14 years 7 months ago
Computing crossing numbers in quadratic time
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...
Martin Grohe
ENTCS
2006
137views more  ENTCS 2006»
13 years 7 months ago
Coinductive Field of Exact Real Numbers and General Corecursion
In this article we present a method to define algebraic structure (field operations) on a representation of real numbers by coinductive streams. The field operations will be given...
Milad Niqui
SODA
2010
ACM
200views Algorithms» more  SODA 2010»
14 years 4 months ago
Algorithms for ray class groups and Hilbert class fields
This paper analyzes the complexity of problems from class field theory. Class field theory can be used to show the existence of infinite families of number fields with constant ro...
Sean Hallgren, Kirsten Eisentraeger
MOC
2000
78views more  MOC 2000»
13 years 7 months ago
Using number fields to compute logarithms in finite fields
We describe an adaptation of the number field sieve to the problem of computing logarithms in a finite field. We conjecture that the running time of the algorithm, when restricted ...
Oliver Schirokauer