461 search results - page 35 / 93 » Practical polynomial factoring in polynomial time |
91
Voted
ATAL
2005
Springer
15 years 3 months ago
2005
Springer
Agents or agent teams deployed to assist humans often face the challenges of monitoring the state of key processes in their environment (including the state of their human users t...
SPAA
2003
ACM
15 years 2 months ago
2003
ACM
In a (randomized) oblivious routing scheme the path chosen for a request between a source s and a target t is independent from the current traffic in the network. Hence, such a sc...
154
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
We prove that hull consistency for a system of equations or inequalities can be achieved in polynomial time providing that the underlying functions are monotone with respect to eac...
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
PQCRYPTO
2010
15 years 1 months ago
2010
Abstract. In this paper a new structural attack on the McEliece/Niederreiter public key cryptosystem based on subcodes of generalized ReedSolomon codes proposed by Berger and Loidr...