TransWikia.com

Is mathematical proof itself NP-hard?

Theoretical Computer Science Asked on October 30, 2021

At the 8:00 mark of this video, he claims that proving things is itself an NP problem. I’m looking for more insight into this. Could someone help explain this concept to me and also provide a link to some further reading? I’m trying to get a better understanding of the relationships between complexity classes.

One Answer

Here is a link to some lecture notes that answer my question - http://www.cs.cornell.edu/~sabhar/publications/iaspcmi-proofcomplexity00.pdf

Proof complexity is a vast field of mathematics.

Answered by Atsina on October 30, 2021

Add your own answers!

Ask a Question

Get help from others!

© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP