36781 search results - page 82 / 7357 » Parameterizing by the Number of Numbers |
MOC
2002
13 years 10 months ago
2002
Erdos conjectured that there are x1-o(1) Carmichael numbers up to x, whereas Shanks was skeptical as to whether one might even find an x up to which there are more than x Carmicha...
MOC
2002
13 years 10 months ago
2002
In previous work, the author has extended the concept of regular and irregular primes to the setting of arbitrary totally real number fields k0, using the values of the zeta functi...
SIAMDM
2010
13 years 5 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
MOC
2011
13 years 4 months ago
2011
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...
APPROX
2011
Springer
12 years 10 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...