Sciweavers

28 search results - page 3 / 6
» coco 2005
Sort
View
COCO
2005
Springer
77views Algorithms» more  COCO 2005»
13 years 10 months ago
On the Sensitivity of Cyclically-Invariant Boolean Functions
In this paper we construct a cyclically invariant Boolean function whose sensitivity is Θ(n1/3 ). This result answers two previously published questions. Tur´an (1984) asked if ...
Sourav Chakraborty
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 10 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
COCO
2005
Springer
124views Algorithms» more  COCO 2005»
13 years 10 months ago
Tolerant Versus Intolerant Testing for Boolean Properties
A property tester with high probability accepts inputs satisfying a given property and rejects inputs that are far from satisfying it. A tolerant property tester, as defined by P...
Eldar Fischer, Lance Fortnow
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
13 years 10 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
13 years 7 months ago
Polynomial Identity Testing for Depth 3 Circuits
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
Neeraj Kayal, Nitin Saxena