Thank you very much for your responses.
I just want to make sure I understood:
What is the ratio of the computational resources required to finish an WU to the computational resources required to check it?
In other words, relatively to folding, how hard is the checking?
Thank you again!
Search found 2 matches
- Thu Jul 30, 2015 11:19 am
- Forum: Discussions of General-FAH topics
- Topic: Are finished WU verified?
- Replies: 3
- Views: 1970
- Tue Jul 28, 2015 1:09 am
- Forum: Discussions of General-FAH topics
- Topic: Are finished WU verified?
- Replies: 3
- Views: 1970
Are finished WU verified?
I'm new to this amazing project.
Do the FAH servers, which receive a finished WU, check if its calculations are correct?
In other words, is "folding" a protein an NP-complete problem?
How could you check the WU?
Thank you very much!
Do the FAH servers, which receive a finished WU, check if its calculations are correct?
In other words, is "folding" a protein an NP-complete problem?
How could you check the WU?
Thank you very much!