QMA Lower Bounds for Approximate Counting - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

William Kretschmer. QMA Lower Bounds for Approximate Counting. Electronic Colloquium on Computational Complexity (ECCC), 26:15, 2019. [doi]

@article{Kretschmer19,
  title = {QMA Lower Bounds for Approximate Counting},
  author = {William Kretschmer},
  year = {2019},
  url = {https://eccc.weizmann.ac.il/report/2019/015},
  researchr = {https://researchr.org/publication/Kretschmer19},
  cites = {0},
  citedby = {0},
  journal = {Electronic Colloquium on Computational Complexity (ECCC)},
  volume = {26},
  pages = {15},
}

runs on WebDSL