Sciweavers

9119 search results - page 246 / 1824
» A Simultaneous Search Problem
Sort
View
AAECC
2006
Springer
133views Algorithms» more  AAECC 2006»
15 years 6 months ago
On the low hamming weight discrete logarithm problem for nonadjacent representations
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
James A. Muir, Douglas R. Stinson
CONSTRAINTS
2006
120views more  CONSTRAINTS 2006»
15 years 6 months ago
Constraint Models for the Covering Test Problem
Covering arrays can be applied to the testing of software, hardware and advanced materials, and to the effects of hormone interaction on gene expression. In this paper we develop c...
Brahim Hnich, Steven David Prestwich, Evgeny Selen...
CORR
2007
Springer
76views Education» more  CORR 2007»
15 years 6 months ago
A Light-Based Device for Solving the Hamiltonian Path Problem
In this paper we suggest the use of light for performing useful computations. Namely, we propose a special device which uses light rays for solving the Hamiltonian path problem on ...
Mihai Oltean
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 6 months ago
Solving the Hamiltonian path problem with a light-based computer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...
Mihai Oltean
JSC
2010
107views more  JSC 2010»
15 years 5 months ago
Solving the conjugacy problem in Garside groups by cyclic sliding
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eï...
Volker Gebhardt, Juan González-Meneses