Joined: 23 Dec 17
I was wondering if anyone could point me out to which projects in BOINC are NP (even hard variety) among the existing ones?
For those who would benefit of some extra explaining, NP problems is short for Non-deterministic Polynomial problems.
In plain, they are problems hard to solve yet easy to verify.
Copyright © 2021 University of California. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.