pdf-format: |
|
@InProceedings{hallgren_et_al:LIPIcs:2020:12662, author = {Sean Hallgren and Eunou Lee and Ojas Parekh}, title = {{An Approximation Algorithm for the MAX-2-Local Hamiltonian Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)}, pages = {59:1--59:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-164-1}, ISSN = {1868-8969}, year = {2020}, volume = {176}, editor = {Jaros{\l}aw Byrka and Raghu Meka}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12662}, URN = {urn:nbn:de:0030-drops-126629}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2020.59}, annote = {Keywords: approximation algorithm, quantum computing, local Hamiltonian, mean-field theory, randomized rounding} }
Keywords: | approximation algorithm, quantum computing, local Hamiltonian, mean-field theory, randomized rounding | |
Seminar: | Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020) | |
Issue date: | 2020 | |
Date of publication: | 11.08.2020 |