scientific article
From MaRDI portal
Publication:3187177
DOI10.4086/cjtcs.2016.008zbMath1365.68288OpenAlexW4230867312MaRDI QIDQ3187177
Publication date: 16 August 2016
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2016.008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (9)
Low-Sensitivity Functions from Unambiguous Certificates. ⋮ All Classical Adversary Methods are Equivalent for Total Functions ⋮ Conflict complexity is lower bounded by block sensitivity ⋮ On block sensitivity and fractional block sensitivity ⋮ Unnamed Item ⋮ Quadratically tight relations for randomized query complexity ⋮ On derandomized composition of Boolean functions ⋮ Unnamed Item ⋮ A Composition Theorem for Randomized Query Complexity
Cites Work
- Block sensitivity of minterm-transitive functions
- A note on quantum black-box complexity of almost all Boolean functions
- Composition limits and separating examples for some Boolean function complexity measures
- Complexity measures and decision tree complexity: a survey.
- Polynomial degree vs. quantum query complexity
- Properties and applications of boolean function composition
- Unnamed Item
This page was built for publication:
