A Theoretical Analysis of Query Selection for Collaborative Filtering

Explore this paper's citation graph

Summary

It is proved that no polynomial-time algorithm can have a significantly better bound on the number of queries unless all problems in NP have nO(log log n) time algorithms.

Type
article
Published
2001-07-16
Cited by
23
References
22
Access
Open access

Keywords

Combinatorics, Function (biology), Integer (computer science), Mathematics, Polynomial

References

Cited by

Related papers