scientific article; zbMATH DE number 6820249
From MaRDI portal
Publication:4598199
DOI10.4230/LIPIcs.ICALP.2016.60zbMath1388.68094MaRDI QIDQ4598199
Robin Kothari, Shalev Ben-David
Publication date: 19 December 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
lifting theoremcomposition theoremrandomized query complexitydecision-tree complexitypartition bound
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (6)
Low-Sensitivity Functions from Unambiguous Certificates. ⋮ All Classical Adversary Methods are Equivalent for Total Functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Composition Theorem for Randomized Query Complexity
This page was built for publication:
