3208 search results - page 330 / 642 » A Lower Bound for Primality |
176
click to vote
COR
2010
15 years 6 months ago
2010
This paper presents different methods for solving parallel machine scheduling problems with precedence constraints and setup times between the jobs. Limited discrepancy search met...
161
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
157
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
103
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
With the advent of autonomous robots with two- and three-dimensional scanning capabilities, classical visibility-based exploration methods from computational geometry have gained ...
133
click to vote
CPC
2008
15 years 6 months ago
2008
A set of integers A is called a B2[g] set if every integer m has at most g representations of the form m = a + a , with a a and a, a A. We obtain a new lower bound for F(g, n), t...