"Optimal Composition Theorem for Randomized Query Complexity."

Dmytro Gavinsky et al. (2023)

> Home

Details and statistics

DOI: 10.4086/TOC.2023.V019A009

access: open

type: Journal Article

metadata version: 2024-12-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/toc/GavinskyLSS23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/GavinskyLSS23
Dmytro Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
Optimal Composition Theorem for Randomized Query Complexity. Theory Comput. 19: 1-35 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.