scientific article
From MaRDI portal
Publication:2969658
DOI10.4230/LIPIcs.APPROX-RANDOM.2014.721zbMath1359.68070MaRDI QIDQ2969658
No author found.
Publication date: 22 March 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Zero-information protocols and unambiguity in Arthur-Merlin communication ⋮ Communication costs in a geometric communication network ⋮ Rectangles Are Nonnegative Juntas
This page was built for publication:
