External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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

Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal. A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. In Christel Baier, Ioannis Chatzigiannakis, Paola Flocchini, Stefano Leonardi, editors, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019, July 9-12, 2019, Patras, Greece. Volume 132 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. [doi]

Authors

Dmitry Gavinsky

This author has not been identified. Look up 'Dmitry Gavinsky' in Google

Troy Lee

This author has not been identified. Look up 'Troy Lee' in Google

Miklos Santha

This author has not been identified. Look up 'Miklos Santha' in Google

Swagato Sanyal

This author has not been identified. Look up 'Swagato Sanyal' in Google
runs on