A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity

Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02350840
Contributor : Miklos Santha <>
Submitted on : Wednesday, November 6, 2019 - 10:42:40 AM
Last modification on : Friday, November 8, 2019 - 1:41:08 AM

Identifiers

  • HAL Id : hal-02350840, version 1

Collections

Citation

Miklos Santha, Dmitry Gavinsky, Troy Lee, Swagato Sanyal. A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece. ⟨hal-02350840⟩

Share

Metrics

Record views

6