778 search results - page 56 / 156 » Bounding Smooth Integers |
IJAC
2010
13 years 6 months ago
2010
We show that the following problems are decidable in rank 2 free groups: does a given finitely generated subgroup H contain primitive elements? and does H meet the automorphic or...
CCO
2001
Springer
14 years 5 days ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
DM
2000
13 years 7 months ago
2000
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H(n). This counting function from number the...
WAW
2010
Springer
13 years 5 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...