Sciweavers

12 search results - page 3 / 3
» Extensional Uniformity for Boolean Circuits
Sort
View
ECCC
2010
124views more  ECCC 2010»
13 years 4 months ago
Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
Much work has been done on learning various classes of "simple" monotone functions under the uniform distribution. In this paper we give the first unconditional lower bo...
Vitaly Feldman, Homin K. Lee, Rocco A. Servedio
COCO
2005
Springer
99views Algorithms» more  COCO 2005»
13 years 10 months ago
On the Complexity of Succinct Zero-Sum Games
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...