APA (7th ed.) Citation

Abbott, A. A., Mhalla, M., & Pocreau, P. (2025). Classical and Quantum Query Complexity of Boolean Functions under Indefinite Causal Order. Electronic proceedings in theoretical computer science, 426, 270-300. https://doi.org/10.4204/EPTCS.426.11

Chicago Style (17th ed.) Citation

Abbott, Alastair A., Mehdi Mhalla, and Pierre Pocreau. "Classical and Quantum Query Complexity of Boolean Functions Under Indefinite Causal Order." Electronic Proceedings in Theoretical Computer Science 426 (2025): 270-300. https://doi.org/10.4204/EPTCS.426.11.

MLA (9th ed.) Citation

Abbott, Alastair A., et al. "Classical and Quantum Query Complexity of Boolean Functions Under Indefinite Causal Order." Electronic Proceedings in Theoretical Computer Science, vol. 426, 2025, pp. 270-300, https://doi.org/10.4204/EPTCS.426.11.