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. |
---|---|
Other Authors: | CENTRE FOR QUANTUM TECHNOLOGIES |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/117252 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Optimal direct sum results for deterministic and randomized decision tree complexity
by: Jain, R., et al.
Published: (2013) -
On the hitting times of quantum versus random walks
by: Magniez, F., et al.
Published: (2014) -
On the hitting times of quantum versus random walks
by: Magniez, F., et al.
Published: (2014) -
Improved quantum query algorithms for triangle finding and associativity testing
by: Lee, T., et al.
Published: (2014) -
Oblique decision tree ensemble via twin bounded SVM
by: Ganaie, M. A., et al.
Published: (2022)