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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
51
search results - page 11 / 11
»
Quantum lower bounds for the Goldreich-Levin problem
Sort
relevance
views
votes
recent
update
View
thumb
title
37
click to vote
COCO
2008
Springer
146
views
Algorithms
»
more
COCO 2008
»
A Direct Product Theorem for Discrepancy
13 years 10 months ago
Download
www1.cs.columbia.edu
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
Troy Lee, Adi Shraibman, Robert Spalek
claim paper
Read More »
« Prev
« First
page 11 / 11
Last »
Next »