BibTeX record journals/cc/AmbainisW14

download as .bib file

@article{DBLP:journals/cc/AmbainisW14,
  author       = {Andris Ambainis and
                  Ronald de Wolf},
  title        = {How Low can Approximate Degree and Quantum Query Complexity be for
                  Total Boolean Functions?},
  journal      = {Comput. Complex.},
  volume       = {23},
  number       = {2},
  pages        = {305--322},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00037-014-0083-2},
  doi          = {10.1007/S00037-014-0083-2},
  timestamp    = {Sun, 15 Mar 2020 19:46:48 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/AmbainisW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.