More Web Proxy on the site http://driver.im/

default search action

combined dblp search
author search
venue search
publication search

ask others

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

Dmitry Gavinsky et al. (2019)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2019.64

access: open

type: Conference or Workshop Paper

metadata version: 2019-07-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/GavinskyLSS19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/GavinskyLSS19
Dmitry Gavinsky, Troy Lee, Miklos Santha, Swagato Sanyal:
A Composition Theorem for Randomized Query Complexity via Max-Conflict Complexity. ICALP 2019: 64:1-64: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.