scientific article
From MaRDI portal
Publication:3191149
DOI10.4086/cjtcs.2014.006zbMath1372.68102arXiv1302.4207OpenAlexW4253960843MaRDI QIDQ3191149
Publication date: 24 September 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.4207
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
On (simple) decision tree rank ⋮ Unnamed Item ⋮ A Composition Theorem for Randomized Query Complexity
Cites Work
- Unnamed Item
- Optimal direct sum results for deterministic and randomized decision tree complexity
- On the degree of Boolean functions as real polynomials
- Complexity measures and decision tree complexity: a survey.
- Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
This page was built for publication:
