3208 search results - page 67 / 642 » A Lower Bound for Primality |
ASIACRYPT
2008
Springer
14 years 3 days ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
ICCV
2001
IEEE
15 years 1 days ago
2001
IEEE
ICIP
2004
IEEE
14 years 11 months ago
2004
IEEE
We propose a registration algorithm based on successively refined quantization and an alignment metric derived from a minimal spanning tree entropy estimate. The metric favors edg...
STOC
2007
ACM
14 years 10 months ago
2007
ACM
STOC
2002
ACM
14 years 10 months ago
2002
ACM
We prove that any Resolution proof for the weak pigeon hole principle, with n holes and any number of pigeons, is of length (2n ), (for some global constant > 0).