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
206
search results - page 22 / 42
»
On the Complexity of Quantum ACC
Sort
relevance
views
votes
recent
update
View
thumb
title
96
Voted
ISAAC
2007
Springer
105
views
Algorithms
»
more
ISAAC 2007
»
Unbounded-Error Classical and Quantum Communication Complexity
15 years 8 months ago
Download
www.lab2.kuis.kyoto-u.ac.jp
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
claim paper
Read More »
101
click to vote
TAMC
2007
Springer
95
views
Applied Computing
»
more
TAMC 2007
»
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
15 years 8 months ago
Download
www.lri.fr
Iordanis Kerenidis
claim paper
Read More »
91
Voted
FOCS
2003
IEEE
122
views
Theoretical Computer Science
»
more
FOCS 2003
»
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
15 years 7 months ago
Download
www.comp.nus.edu.sg
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
claim paper
Read More »
50
Voted
CORR
2008
Springer
69
views
Education
»
more
CORR 2008
»
Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity
15 years 1 months ago
Download
www.comp.nus.edu.sg
Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan
claim paper
Read More »
84
Voted
FFA
2006
79
views
more
FFA 2006
»
Why is quantum physics based on complex numbers?
15 years 1 months ago
Download
www.quantmagic.narod.ru
Felix M. Lev
claim paper
Read More »
« Prev
« First
page 22 / 42
Last »
Next »