Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2
search results - page 1 / 1
»
Small Sample Spaces Cannot Fool Low Degree Polynomials
Sort
relevance
views
votes
recent
update
View
thumb
title
112
Voted
APPROX
2008
Springer
86
views
Algorithms
»
more
APPROX 2008
»
Small Sample Spaces Cannot Fool Low Degree Polynomials
15 years 5 months ago
Download
www.math.tau.ac.il
Noga Alon, Ido Ben-Eliezer, Michael Krivelevich
claim paper
Read More »
106
click to vote
FOCS
2007
IEEE
90
views
Theoretical Computer Science
»
more
FOCS 2007
»
Polylogarithmic Independence Can Fool DNF Formulas
15 years 9 months ago
Download
www.mit.edu
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
Louay Bazzi
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »