2 search results - page 1 / 1 » Tightly-Secure Pseudorandom Functions via Work Factor Partit... |
ICCAD
2001
IEEE
14 years 1 months ago
2001
IEEE
The increasing popularity of SAT and BDD techniques in verification and synthesis encourages the search for additional speed-ups. Since typical SAT and BDD algorithms are exponent...
SIGECOM
2008
ACM
13 years 4 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...