Style de citation APA (7e éd.)

Incudini, M., Gyurik, C., Molteni, R., & Dunjko, V. (2024). Testing the presence of balanced and bipartite components in a sparse graph is QMA1-hard.

Style de citation Chicago (17e éd.)

Incudini, Massimiliano, Casper Gyurik, Riccardo Molteni, et Vedran Dunjko. Testing the Presence of Balanced and Bipartite Components in a Sparse Graph Is QMA1-hard. 2024.

Style de citation MLA (9e éd.)

Incudini, Massimiliano, et al. Testing the Presence of Balanced and Bipartite Components in a Sparse Graph Is QMA1-hard. 2024.