Sciweavers

36781 search results - page 56 / 7357
» Parameterizing by the Number of Numbers
Sort
View
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
13 years 10 months ago
New Lower Bounds for Heilbronn Numbers
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
Francesc Comellas, J. Luis A. Yebra
JC
2000
89views more  JC 2000»
13 years 10 months ago
Weakly Computable Real Numbers
The Turing degree of a real number x is defined as the Turing degree of its binary expansion. This definition is quite natural and robust. In this paper we discuss some basic degr...
Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng
MOC
2000
78views more  MOC 2000»
13 years 10 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
DM
1998
69views more  DM 1998»
13 years 9 months ago
A study of the total chromatic number of equibipartite graphs
The total chromatic number zt(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same colo...
Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-C...
MOC
2002
75views more  MOC 2002»
13 years 9 months ago
Average equidistribution and statistical independence properties of digital inversive pseudorandom numbers over parts of the per
This article deals with the digital inversive method for generating uniform pseudorandom numbers. Equidistribution and statistical independence properties of the generated pseudora...
Frank Emmerich