Sciweavers

2432 search results - page 44 / 487
» Degrees and choice numbers
Sort
View
ANTS
1998
Springer
139views Algorithms» more  ANTS 1998»
15 years 6 months ago
Generating Arithmetically Equivalent Number Fields with Elliptic Curves
In this note we address the question whether for a given prime number p, the zeta-function of a number field always determines the p-part of its class number. The answer is known t...
Bart de Smit
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
15 years 3 months ago
Balancing Degree, Diameter and Weight in Euclidean Spanners
Abstract. In a seminal STOC'95 paper, Arya et al. [4] devised a construction that for any set S of n points in Rd and any > 0, provides a (1 + )-spanner with diameter O(lo...
Shay Solomon, Michael Elkin
SODA
2010
ACM
248views Algorithms» more  SODA 2010»
15 years 11 months ago
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
Petr Hlineny, Markus Chimani
142
Voted
MOC
2011
14 years 8 months ago
Class numbers of ray class fields of imaginary quadratic fields
Let K be an imaginary quadratic field with class number one and let p ⊂ OK be a degree one prime ideal of norm p not dividing 6dK . In this paper we generalize an algorithm of S...
Omer Kucuksakalli
GLOBECOM
2006
IEEE
15 years 8 months ago
Protograph LDPC Codes with Node Degrees at Least 3
— In this paper we present protograph codes with a small number of degree-3 nodes and one high degree node. The iterative decoding threshold for proposed rate 1/2 codes are lower...
Dariush Divsalar, Christopher Jones