COCO
2008
Springer
14 years 1 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...
COCO
2008
Springer
14 years 1 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...
COCO
2008
Springer
14 years 1 months ago
2008
Springer
COCO
2008
Springer
14 years 1 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,...
COCO
2008
Springer
14 years 1 months ago
2008
Springer
COCO
2008
Springer
14 years 1 months ago
2008
Springer
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...
COCO
2008
Springer
14 years 1 months ago
2008
Springer
We study the approximability of predicates on k variables from a domain [q], and give a new sufficient condition for such predicates to be approximation resistant under the Unique...
COCO
2008
Springer
14 years 1 months ago
2008
Springer
COCO
2008
Springer
14 years 1 months ago
2008
Springer
COCO
2008
Springer
14 years 1 months ago
2008
Springer
