Filter your results
- 5
- 3
- 2
- 5
- 1
- 2
- 1
- 1
- 5
- 5
- 4
- 2
- 1
- 5
- 5
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
|
Quadratically Tight Relations for Randomized Query ComplexityTheory of Computing Systems, 2020, 64, pp.101-119. ⟨10.1007/s00224-019-09935-x⟩
Journal articles
hal-02351409v1
|
||
|
Separations in Communication Complexity Using Cheat Sheets and Information Complexity2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), Oct 2016, New Brunswick, United States. pp.555-564, ⟨10.1109/FOCS.2016.66⟩
Conference papers
hal-02350817v1
|
||
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece
Conference papers
hal-02350840v1
|
|||
Strategies for Quantum Races10th Innovations in Theoretical Computer Science Conference (ITCS 2019), 2019, Seattle, United States
Conference papers
hal-02350866v1
|
|||
Improved Quantum Query Algorithms for Triangle Detection and Associativity TestingAlgorithmica, 2017, 77, pp.459-486. ⟨10.1007/s00453-015-0084-9⟩
Journal articles
hal-03753536v1
|