scientific article
From MaRDI portal
Publication:2825306
DOI10.4086/cjtcs.2016.012zbMath1388.68138arXiv1506.02936OpenAlexW4236151122MaRDI QIDQ2825306
Publication date: 7 October 2016
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.02936
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (3)
Structure of Protocols for XOR Functions ⋮ Optimality of linear sketching under modular updates ⋮ On the decision tree complexity of threshold functions
This page was built for publication:
