First Page | Document Content | |
---|---|---|
Date: 2012-12-14 16:07:15Models of computation Decision tree model Binary trees Quantum algorithm PP Randomized algorithm Quantum computer Random binary tree Switching lemma Theoretical computer science Applied mathematics Computational complexity theory | Almost all decision trees do not allow significant quantum speed-upAdd to Reading ListSource URL: cjtcs.cs.uchicago.eduDownload Document from Source WebsiteFile Size: 166,55 KBShare Document on Facebook |