Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

82

CORR
2010
Springer

43views Education» more CORR 2010»

Quantum query complexity of minor-closed graph properties

14 years 11 months ago

Quantum query complexity of minor-closed graph properties

Download qip2011.quantumlah.org

Andrew M. Childs, Robin Kothari

Real-time Traffic

CORR 2010 | Education |

claim paper

Related Content

» Every MinorClosed Property of Sparse Graphs is Testable

» Graph Properties and Circular Functions How Low Can Quantum Query Complexity Go

» New Results on Quantum Property Testing

» Sharp Quantum versus Classical Query Complexity Separations

» The Quantum Query Complexity of Algebraic Properties

» Quantum Query Complexity of Some Graph Problems

» Quantum Algorithms for Testing Properties of Distributions

» Improved outputsensitive quantum algorithms for Boolean matrix multiplication

» Quantum versus Classical Learnability

Post Info
More Details (n/a)

Added	01 Mar 2011
Updated	01 Mar 2011
Type	Journal
Year	2010
Where	CORR
Authors	Andrew M. Childs, Robin Kothari

Comments (0)