scientific article; zbMATH DE number 6789269
From MaRDI portal
Publication:5368738
DOI10.4230/LIPIcs.CCC.2016.4zbMath1380.68209arXiv1512.01210MaRDI QIDQ5368738
Martins Kokainis, Robin Kothari, Andris Ambainis
Publication date: 10 October 2017
Full work available at URL: https://arxiv.org/abs/1512.01210
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) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (8)
Low-Sensitivity Functions from Unambiguous Certificates. ⋮ Time-Space Complexity Advantages for Quantum Computing ⋮ Deterministic Communication vs. Partition Number ⋮ Query-to-Communication Lifting for BPP ⋮ Unnamed Item ⋮ Quadratically tight relations for randomized query complexity ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
