152 search results - page 22 / 31 » Solving hard instances of floorplacement |
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
ASIACRYPT
2009
Springer
14 years 1 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
BMCBI
2007
13 years 7 months ago
2007
Background: The ab initio protein folding problem consists of predicting protein tertiary structure from a given amino acid sequence by minimizing an energy function; it is one of...
ASIACRYPT
2001
Springer
13 years 11 months ago
2001
Springer
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...