scientific article; zbMATH DE number 7209615
From MaRDI portal
Publication:5112820
zbMath1435.68105arXiv1509.07766MaRDI QIDQ5112820
Or Sattath, Siddhardh C. Morampudi, Roderich Moessner, Chris R. Laumann
Publication date: 8 June 2020
Full work available at URL: https://arxiv.org/abs/1509.07766
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorics in computer science (68R05) Quantum computation (81P68) Combinatorial probability (60C05) Quantum algorithms and complexity in the theory of computing (68Q12) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computational aspects of satisfiability (68R07)
Related Items (3)
Quantum Max-flow/Min-cut ⋮ Total functions in QMA ⋮ On efficiently solvable cases of quantum \(k\)-SAT
This page was built for publication: