APA (7th ed.) Citation

Hrubeš, P. (2025). Hard submatrices for non-negative rank and communication complexity. Computational complexity, 34(2), 9. https://doi.org/10.1007/s00037-025-00269-4

Chicago Style (17th ed.) Citation

Hrubeš, Pavel. "Hard Submatrices for Non-negative Rank and Communication Complexity." Computational Complexity 34, no. 2 (2025): 9. https://doi.org/10.1007/s00037-025-00269-4.

MLA (9th ed.) Citation

Hrubeš, Pavel. "Hard Submatrices for Non-negative Rank and Communication Complexity." Computational Complexity, vol. 34, no. 2, 2025, p. 9, https://doi.org/10.1007/s00037-025-00269-4.