scientific article; zbMATH DE number 6767569

DOI10.4230/LIPIcs.APPROX-RANDOM.2015.915zbMath1375.68061arXiv1504.01339MaRDI QIDQ5351943

Robin Kothari, Miklos Santha, David Racicot-Desloges

Publication date: 31 August 2017

Full work available at URL: https://arxiv.org/abs/1504.01339

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

randomized algorithmsquery complexitydecision tree complexitysubcube partition complexity

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Related Items (2)

Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Deterministic Communication vs. Partition Number

This page was built for publication: