572 search results - page 73 / 115 » Exponential-Time Approximation of Hard Problems |
CEAS
2005
Springer
15 years 18 hour ago
2005
Springer
Human interaction proofs (HIPs) have become commonplace on the internet for protecting free online services from abuse by automated scripts/bots. They are challenges designed to b...
100
click to vote
SPIRE
2010
Springer
14 years 8 months ago
2010
Springer
The Longest Common Subsequence (LCS) of two or more strings is a fundamental well-studied problem which has a wide range of applications throughout computational sciences. When the...
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
ASIACRYPT
2009
Springer
15 years 4 months ago
2009
Springer
We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in cons...
CODES
1998
IEEE
15 years 2 months ago
1998
IEEE
Timing analysis for checking satisfaction of constraints is a crucial problem in real-time system design. In some current approaches, the delay of software modules is precalculate...