"Improved Bounds for the Randomized Decision Tree Complexity of Recursive ..."

Frédéric Magniez et al. (2011)

> Startseite

Details and statistics

DOI: 10.1007/978-3-642-22006-7_27

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icalp/MagniezNSX11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/MagniezNSX11
Frédéric Magniez, Ashwin Nayak, Miklos Santha, David Xiao:
Improved Bounds for the Randomized Decision Tree Complexity of Recursive Majority. ICALP (1) 2011: 317-329

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.