What is it about?
The first version of our proof
Featured Image
Why is it important?
To study computational complexity
Perspectives
Consideration of equivalence
Mirzakhmet Syzdykov
Read the Original
This page is a summary of: On Equivalence of Tractable and Non-polynomial Classes of Complexity, October 2025, Cambridge University Press,
DOI: 10.33774/coe-2025-3g759.
You can read the full text:
Contributors
The following have contributed to this page
