Why the Concept of Computational Complexity is Hard for Verifiable Mathematics

Juraj Hromkovic. Why the Concept of Computational Complexity is Hard for Verifiable Mathematics. Electronic Colloquium on Computational Complexity (ECCC), 22:159, 2015. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.