Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).”10.1007/s00037-022-00231-8__Computational Complexity, vol. 31, no. 2, 13, Springer Science and Business Media LLC, 2022, doi:10.1007/s00037-022-00231-8.
LibreCat: /record/34700
DOI: 10.1007/s00037-022-00231-8

Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.”10.1007/bf01270387__Computational Complexity, 1997, pp. 357–75, doi:10.1007/bf01270387.
LibreCat: /record/16564
DOI: 10.1007/bf01270387