Please, check my P=NP proof for errors
25 views
Skip to first unread message
Victor Porton
Aug 17, 2023, 7:56:14 PM8/17/23
to LOGICA-L
The proof uses logic (incompleteness of ZFC) [thus on-topic in this list], algorithms taking algorithms as input, inversion of bijections, reduction of SAT to another NP problem [using logic].
A practically efficient NP-complete algorithm is not yet found.
Reply all
Reply to author
Forward
0 new messages