×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [subset x x]
1 NP-completeness Lecture 2: Jan 11. 2 P The class of problems that can be solved in polynomial time. e.g. gcd, shortest path, prime, etc. There are many
216 views
Chapter VII: Frequent Itemsets & Association Rules
58 views
NP-completeness
48 views
Chapter VII: Frequent Itemsets & Association Rules Information Retrieval & Data Mining Universität des Saarlandes, Saarbrücken Winter Semester 2011/12
217 views