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.
Chapter VII: Frequent Itemsets & Association Rules
NP-completeness
Chapter VII: Frequent Itemsets & Association Rules Information Retrieval & Data Mining Universität des Saarlandes, Saarbrücken Winter Semester 2011/12.
