Sciweavers

7 search results - page 1 / 2
» coco 1990
Sort
View
COCO
1990
Springer
84views Algorithms» more  COCO 1990»
14 years 18 days ago
Some Connections Between Bounded Query Classes and Non-Uniform Complexity
Amihood Amir, Richard Beigel, William I. Gasarch
COCO
1990
Springer
71views Algorithms» more  COCO 1990»
14 years 18 days ago
Circuits, Pebbling and Expressibility
V. Vinay, H. Venkateswaran, C. E. Veni Madhavan
COCO
2009
Springer
96views Algorithms» more  COCO 2009»
14 years 3 months ago
Poly-logarithmic Independence Fools AC0 Circuits
We prove that poly-sized AC0 circuits cannot distinguish a poly-logarithmically independent distribution from the uniform one. This settles the 1990 conjecture by Linial and Nisan...
Mark Braverman
COCO
1990
Springer
50views Algorithms» more  COCO 1990»
14 years 18 days ago
Width-Bounded Reducibility and Binary Search over Complexity Classes
d Abstract) Eric Allender Christopher Wilson Department of Computer Science Department of Computer Rutgers University and Information Science New Brunswick, NJ 08903, USA Universit...
Eric Allender, Christopher B. Wilson