Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
RSA
2006
104views more  RSA 2006»
10 years 4 months ago
The satisfiability threshold for randomly generated binary constraint satisfaction problems
Abstract. We study two natural models of randomly generated constraint satisfaction problems. We determine how quickly the domain size must grow with n to ensure that these models ...
Alan M. Frieze, Michael Molloy
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
10 years 9 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
books