Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.

1 Publication


2014 | Journal Article | LibreCat-ID: 8171 | OA
S. Gharibian and J. Kempe, “Hardness of approximation for quantum problems,” Quantum Information & Computation, vol. 14, no. 5–6, pp. 517–540, 2014.
LibreCat | Download (ext.) | arXiv
 

Filters and Search Terms

keyword="polynomial time hierarchy"

Search

Filter Publications

Display / Sort

Citation Style: IEEE

Export / Embed