3 ms·
Sounds like a NP-hard problem, am I correct?
by Devilboy 16y ago
Sounds like a NP-hard problem, am I correct?
- Groxx 16y agoNot so much. Trust metrics (underpinning Google's PageRank) are pretty efficient at this sort of thing. If people A-Q all vote each other up, but nobody votes them up, their weighted effect is pretty close to nil. Try: http://en.wikipedia.org/wiki/Trust_metric http://en.wikipedia.org/wiki/Trust_metric http://en.wikipedia.org/wiki/PageRank http://en.wikipedia.org/wiki/PageRank and http://www.advogato.org/trust-metric.html http://www.advogato.org/trust-metric.html for a bit of an overview.
- _delirium 16y agoI think the bigger problem is developing an algorithm that reliably solves this problem (and doesn't introduce collateral damage), rather than the computational complexity of the algorithm.