Wiki also says:
A famous network of conditional proofs is the NP-complete class of complexity theory
|
1 | [made Community Wiki] | ||
|
|
||||
|
|
1 | [made Community Wiki] | ||
|
Wiki also says:
|
||||
