"A Composition Theorem for Randomized Query Complexity."

Anurag Anshu et al. (2017)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2017.10

access: open

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/AnshuGJKLMSS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/AnshuGJKLMSS17
Anurag Anshu, Dmitry Gavinsky, Rahul Jain, Srijita Kundu, Troy Lee, Priyanka Mukhopadhyay, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity. FSTTCS 2017: 10:1-10:13

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.