APA (7th ed.) Citation

Goubault-Larrecq, A., & Perrot, K. (2024). Rice-like complexity lower bounds for Boolean and uniform automata networks.

Chicago Style (17th ed.) Citation

Goubault-Larrecq, Aliénor, and Kévin Perrot. Rice-like Complexity Lower Bounds for Boolean and Uniform Automata Networks. 2024.

MLA (9th ed.) Citation

Goubault-Larrecq, Aliénor, and Kévin Perrot. Rice-like Complexity Lower Bounds for Boolean and Uniform Automata Networks. 2024.

Warning: These citations may not always be 100% accurate.