STOC 2000 - PDF Preprint Papers

STOC 2000 Annual ACM Symposium on Theory of Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed STOC-2000 Paper

click to vote

STOC
2000
ACM

174views Algorithms» more STOC 2000»

Noise-tolerant learning, the parity problem, and the statistical query model

13 years 8 months ago

Download ttic.uchicago.edu

We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classiﬁcation noise, a problem closely related to several cryptograph...

Avrim Blum, Adam Kalai, Hal Wasserman

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	174	Noise-tolerant learning, the parity problem, and the statistical query model	claim
2	156	Near optimal multiple alignment within a band in polynomial time	claim
3	137	Approximate nearest neighbors and sequence comparison with block operations	claim
4	137	On the complexity of verifiable secret sharing and multiparty computation	claim
5	136	A constant factor approximation algorithm for a class of classification problems	claim
6	134	Computing the median with uncertainty	claim
7	123	List decoding algorithms for certain concatenated codes	claim
8	122	Polynomial-time approximation scheme for data broadcast	claim
9	117	Faster suffix tree construction with missing suffix links	claim
10	112	A random graph model for massive graphs	claim
11	105	A guessing game and randomized online algorithms	claim
12	102	Hard-Potato routing	claim
13	97	Quantum lower bounds by quantum arguments	claim
14	96	Balanced allocations: the heavily loaded case	claim
15	95	Parallelization, amplification, and exponential time simulation of quantum interactive proof systems	claim
16	83	Smoothing and cleaning up slivers	claim
17	81	A unified approach to approximating resource allocation and scheduling	claim
18	77	A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees	claim
19	73	Combining fairness with throughput: online routing with multiple objectives	claim
20	69	Tight(er) worst-case bounds on dynamic searching and priority queues	claim
21	66	On the sum-of-squares algorithm for bin packing	claim
22	55	Self-testing of universal and fault-tolerant sets of quantum gates	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers