Pages that link to "Item:Q1871636"
From MaRDI portal
The following pages link to The quantum black-box complexity of majority (Q1871636):
Displaying 9 items.
- Finding a majority ball with majority answers (Q322261) (← links)
- Finding a non-minority ball with majority answers (Q505416) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q2208365) (← links)
- Revisiting Deutsch-Jozsa algorithm (Q2216118) (← links)
- On exact quantum query complexity (Q2350895) (← links)
- Improved bounds for the randomized decision tree complexity of recursive majority (Q2811168) (← links)
- Almost all decision trees do not allow significant quantum speed-up (Q5414603) (← links)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Adaptive majority problems for restricted query graphs and for weighted sets (Q6621188) (← links)