3208 search results - page 60 / 642 » A Lower Bound for Primality |
SIGECOM
2008
ACM
13 years 10 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
ESA
2004
Springer
14 years 3 months ago
2004
Springer
Abstract. Classical network flow theory allows decomposition of flow into several chunks of arbitrary sizes traveling through the network on different paths. In the first part ...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
We consider a number of dynamic problems with no known poly-logarithmic upper bounds, and show that they require n(1) time per operation, unless 3SUM has strongly subquadratic alg...
ICASSP
2008
IEEE
14 years 4 months ago
2008
IEEE
This paper derives the Cramer-Rao lower bound (CRLB) on estimates of the frequency of a coherent pulse-train passively intercepted at a moving antenna. Such estimates are used to ...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...