124
click to vote
COCO
15 years 2 months ago
2008 Springer 
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
120
Voted
COCO
15 years 2 months ago
2008 Springer 
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
88
Voted
COCO
15 years 2 months ago
2008 Springer 
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
103
click to vote
COCO
2008 Springer Exponential Separation of Quantum and Classical Non-interactive Multi-party Communication Complexity
15 years 2 months ago
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing setti...
123
Voted
COCO
15 years 2 months ago
2008 Springer 
We study the complexity of deciding whether a given homogeneous multivariate polynomial has a nontrivial root over a finite field. Given a homogeneous algebraic circuit C that com...
|
Algorithms