395 search results - page 49 / 79 » Positive Versions of Polynomial Time |
107
click to vote
TCOS
2010
14 years 4 months ago
2010
Abstract. In [24] Raddum and Semaev propose a technique to solve systems of polynomial equations over F2 as occurring in algebraic attacks on block ciphers. This approach is known ...
ASPDAC
2006
ACM
15 years 3 months ago
2006
ACM
— Process variations in digital circuits make sequential circuit timing validation an extremely challenging task. In this paper, a Statistical Bellman-Ford (SBF) algorithm is pro...
109
click to vote
ALGOSENSORS
2007
Springer
15 years 1 months ago
2007
Springer
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
CRYPTO
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q, d, dp, dq , q-1 p ). Assume that we obtain partial error-free information of sk, e.g., ass...
130
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...