4913 search results - page 164 / 983 » Results and Perspectives of the G |
168
click to vote
MOC
2000
15 years 6 months ago
2000
These tables record results on curves with many points over finite fields. For relatively small genus (0 g 50) and q a small power of 2 or 3 we give in two tables the best presen...
142
click to vote
MOC
2000
15 years 6 months ago
2000
Abstract. I describe a modification to Shanks' baby-step giant-step algorithm for computing the order n of an element g of a group G, assuming n is finite. My method has the a...
172
click to vote
EJC
2008
15 years 5 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
216
click to vote
GC
2010
Springer
15 years 5 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
153
click to vote
JEA
2010
15 years 1 months ago
2010
An upward drawing of a DAG G is a drawing of G in which all edges are drawn as curves increasing monotonically in the vertical direction. In this paper, we present a new approach f...