Sciweavers

21 search results - page 1 / 5
» coco 2010
Sort
View
107
Voted
COCO
2010
Springer
146views Algorithms» more  COCO 2010»
15 years 6 months ago
The Partition Bound for Classical Communication Complexity and Query Complexity
Rahul Jain, Hartmut Klauck
105
Voted
COCO
2010
Springer
125views Algorithms» more  COCO 2010»
15 years 6 months ago
On the Power of Randomized Reductions and the Checkability of SAT
Mohammad Mahmoody, David Xiao
86
Voted
COCO
2010
Springer
136views Algorithms» more  COCO 2010»
15 years 6 months ago
Relationless Completeness and Separations
Pavel Hrubes, Avi Wigderson, Amir Yehudayoff
78
Voted
COCO
2010
Springer
107views Algorithms» more  COCO 2010»
15 years 6 months ago
Fooling Functions of Halfspaces under Product Distributions
Parikshit Gopalan, Ryan O'Donnell, Yi Wu, David Zu...
114
Voted
COCO
2010
Springer
131views Algorithms» more  COCO 2010»
15 years 5 days ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang