NP-type BOINC projects


Advanced search

Message boards : Projects : NP-type BOINC projects
Message board moderation

To post messages, you must log in.

AuthorMessage
JFQueralt
Avatar

Send message
Joined: 23 Dec 17
Posts: 2
Philippines
Message 85706 - Posted: 4 Apr 2018, 7:16:12 UTC

Hello, everyone.

I was wondering if anyone could point me out to which projects in BOINC are NP (even hard variety) among the existing ones?

Thanks.
Cheers.

PS:
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.
https://en.m.wikipedia.org/wiki/NP_(complexity)
ID: 85706 · Report as offensive

Message boards : Projects : NP-type BOINC projects

Copyright © 2024 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.