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
241
search results - page 1 / 49
»
On the theoretical lower bound of the multiplicative complex...
Sort
relevance
views
votes
recent
update
View
thumb
title
23
click to vote
ISCAS
1993
IEEE
62
views
Hardware
»
more
ISCAS 1993
»
On the theoretical lower bound of the multiplicative complexity for DCT
14 years 3 months ago
Download
repository.lib.polyu.edu.hk
Yuk-Hee Chan, Wan-Chi Siu
claim paper
Read More »
25
click to vote
ICALP
2005
Springer
121
views
Programming Languages
»
more
ICALP 2005
»
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
14 years 4 months ago
Download
drops.dagstuhl.de
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál
claim paper
Read More »
27
click to vote
FOCS
2003
IEEE
122
views
Theoretical Computer Science
»
more
FOCS 2003
»
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
14 years 4 months ago
Download
www.comp.nus.edu.sg
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
claim paper
Read More »
31
click to vote
FOCS
1999
IEEE
105
views
Theoretical Computer Science
»
more
FOCS 1999
»
A Near-Tight Lower Bound on the Time Complexity of Distributed MST Construction
14 years 3 months ago
Download
web.sau.edu
David Peleg, Vitaly Rubinovich
claim paper
Read More »
30
click to vote
CSR
2009
Springer
96
views
Theoretical Computer Science
»
more
CSR 2009
»
Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials
14 years 5 months ago
Download
itcs.tsinghua.edu.cn
Maurice J. Jansen
claim paper
Read More »
« Prev
« First
page 1 / 49
Last »
Next »