6740 search results - page 247 / 1348 » An s -Hamiltonian Line Graph Problem |
106
click to vote
AAAI
2008
15 years 3 months ago
2008
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
137
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from elli...
CIAC
2000
Springer
15 years 5 months ago
2000
Springer
We consideralgorithms for a simple one-dimensionalpoint placement problem: given N points on a line, and noisy measurements of the distances between many pairs of them, estimate th...
104
click to vote
ALGORITHMICA
2006
15 years 23 days ago
2006
It has been suggested that a major obstacle in finding an index calculus attack on the elliptic curve discrete logarithm problem lies in the difficulty of lifting points from ellip...
91
Voted
SIAMJO
2010
14 years 11 months ago
2010
In this paper, we propose a hybrid Gauss-Newton structured BFGS method with a new update formula and a new switch criterion for the iterative matrix to solve nonlinear least square...