---
_id: '34700'
article_number: '13'
author:
- first_name: Sevag
  full_name: Gharibian, Sevag
  id: '71541'
  last_name: Gharibian
  orcid: 0000-0002-9992-3379
- first_name: Miklos
  full_name: Santha, Miklos
  last_name: Santha
- first_name: Jamie
  full_name: Sikora, Jamie
  last_name: Sikora
- first_name: Aarthi
  full_name: Sundaram, Aarthi
  last_name: Sundaram
- first_name: Justin
  full_name: Yirka, Justin
  last_name: Yirka
citation:
  ama: Gharibian S, Santha M, Sikora J, Sundaram A, Yirka J. Quantum generalizations
    of the polynomial hierarchy with applications to QMA(2). <i>Computational Complexity</i>.
    2022;31(2). doi:<a href="https://doi.org/10.1007/s00037-022-00231-8">10.1007/s00037-022-00231-8</a>
  apa: Gharibian, S., Santha, M., Sikora, J., Sundaram, A., &#38; Yirka, J. (2022).
    Quantum generalizations of the polynomial hierarchy with applications to QMA(2).
    <i>Computational Complexity</i>, <i>31</i>(2), Article 13. <a href="https://doi.org/10.1007/s00037-022-00231-8">https://doi.org/10.1007/s00037-022-00231-8</a>
  bibtex: '@article{Gharibian_Santha_Sikora_Sundaram_Yirka_2022, title={Quantum generalizations
    of the polynomial hierarchy with applications to QMA(2)}, volume={31}, DOI={<a
    href="https://doi.org/10.1007/s00037-022-00231-8">10.1007/s00037-022-00231-8</a>},
    number={213}, journal={Computational Complexity}, publisher={Springer Science
    and Business Media LLC}, author={Gharibian, Sevag and Santha, Miklos and Sikora,
    Jamie and Sundaram, Aarthi and Yirka, Justin}, year={2022} }'
  chicago: Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin
    Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications
    to QMA(2).” <i>Computational Complexity</i> 31, no. 2 (2022). <a href="https://doi.org/10.1007/s00037-022-00231-8">https://doi.org/10.1007/s00037-022-00231-8</a>.
  ieee: 'S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum generalizations
    of the polynomial hierarchy with applications to QMA(2),” <i>Computational Complexity</i>,
    vol. 31, no. 2, Art. no. 13, 2022, doi: <a href="https://doi.org/10.1007/s00037-022-00231-8">10.1007/s00037-022-00231-8</a>.'
  mla: Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy
    with Applications to QMA(2).” <i>Computational Complexity</i>, vol. 31, no. 2,
    13, Springer Science and Business Media LLC, 2022, doi:<a href="https://doi.org/10.1007/s00037-022-00231-8">10.1007/s00037-022-00231-8</a>.
  short: S. Gharibian, M. Santha, J. Sikora, A. Sundaram, J. Yirka, Computational
    Complexity 31 (2022).
date_created: 2022-12-21T10:53:52Z
date_updated: 2023-02-28T11:07:02Z
department:
- _id: '623'
- _id: '7'
doi: 10.1007/s00037-022-00231-8
intvolume: '        31'
issue: '2'
keyword:
- Computational Mathematics
- Computational Theory and Mathematics
- General Mathematics
- Theoretical Computer Science
language:
- iso: eng
publication: Computational Complexity
publication_identifier:
  issn:
  - 1016-3328
  - 1420-8954
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Quantum generalizations of the polynomial hierarchy with applications to QMA(2)
type: journal_article
user_id: '71541'
volume: 31
year: '2022'
...
---
_id: '16564'
author:
- first_name: Dima
  full_name: Grigoriev, Dima
  last_name: Grigoriev
- first_name: Marek
  full_name: Karpinski, Marek
  last_name: Karpinski
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
- first_name: Roman
  full_name: Smolensky, Roman
  last_name: Smolensky
citation:
  ama: Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound
    for randomized algebraic decision trees. <i>computational complexity</i>. 1997:357-375.
    doi:<a href="https://doi.org/10.1007/bf01270387">10.1007/bf01270387</a>
  apa: Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., &#38; Smolensky, R.
    (1997). A lower bound for randomized algebraic decision trees. <i>Computational
    Complexity</i>, 357–375. <a href="https://doi.org/10.1007/bf01270387">https://doi.org/10.1007/bf01270387</a>
  bibtex: '@article{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1997, title={A
    lower bound for randomized algebraic decision trees}, DOI={<a href="https://doi.org/10.1007/bf01270387">10.1007/bf01270387</a>},
    journal={computational complexity}, author={Grigoriev, Dima and Karpinski, Marek
    and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1997}, pages={357–375}
    }'
  chicago: Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman
    Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” <i>Computational
    Complexity</i>, 1997, 357–75. <a href="https://doi.org/10.1007/bf01270387">https://doi.org/10.1007/bf01270387</a>.
  ieee: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower
    bound for randomized algebraic decision trees,” <i>computational complexity</i>,
    pp. 357–375, 1997.
  mla: Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”
    <i>Computational Complexity</i>, 1997, pp. 357–75, doi:<a href="https://doi.org/10.1007/bf01270387">10.1007/bf01270387</a>.
  short: D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, Computational
    Complexity (1997) 357–375.
date_created: 2020-04-15T10:42:43Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/bf01270387
language:
- iso: eng
page: 357-375
publication: computational complexity
publication_identifier:
  issn:
  - 1016-3328
  - 1420-8954
publication_status: published
status: public
title: A lower bound for randomized algebraic decision trees
type: journal_article
user_id: '15415'
year: '1997'
...