Sciweavers

Share
COCO
2006
Springer
88views Algorithms» more  COCO 2006»
10 years 10 days 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
COCO
2006
Springer
67views Algorithms» more  COCO 2006»
10 years 2 months ago
Exposure-Resilient Extractors
Marius Zimand
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
10 years 2 months ago
How to Get More Mileage from Randomness Extractors
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
Ronen Shaltiel
COCO
2006
Springer
118views Algorithms» more  COCO 2006»
10 years 2 months ago
Learning Monotone Decision Trees in Polynomial Time
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
Ryan O'Donnell, Rocco A. Servedio
COCO
2006
Springer
116views Algorithms» more  COCO 2006»
10 years 2 months ago
A 3-Query Non-Adaptive PCP with Perfect Completeness
Subhash Khot, Rishi Saket
COCO
2006
Springer
89views Algorithms» more  COCO 2006»
10 years 2 months ago
Hardness of the Covering Radius Problem on Lattices
We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show that for any large enough p there exists a constant cp > 1 such that C...
Ishay Haviv, Oded Regev
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
10 years 2 months ago
Strengths and Weaknesses of Quantum Fingerprinting
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
books