Improved bounds for the randomized decision tree complexity of recursive majority
10.1007/978-3-642-22006-7_27
Saved in:
Main Authors: | Magniez, F., Nayak, A., Santha, M., Xiao, D. |
---|---|
其他作者: | CENTRE FOR QUANTUM TECHNOLOGIES |
格式: | Conference or Workshop Item |
出版: |
2014
|
在線閱讀: | http://scholarbank.nus.edu.sg/handle/10635/117252 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | National University of Singapore |
相似書籍
-
Optimal direct sum results for deterministic and randomized decision tree complexity
由: Jain, R., et al.
出版: (2013) -
On the hitting times of quantum versus random walks
由: Magniez, F., et al.
出版: (2014) -
On the hitting times of quantum versus random walks
由: Magniez, F., et al.
出版: (2014) -
Improved quantum query algorithms for triangle finding and associativity testing
由: Lee, T., et al.
出版: (2014) -
Oblique decision tree ensemble via twin bounded SVM
由: Ganaie, M. A., et al.
出版: (2022)