8.4 NP-completeness and 3-SAT Flashcards
(2 cards)
1
Q
What is a CNF formula with width-k, hence what is 3-SAT
A
2
Q
A
- 1.1-2 Proof by induction recap
- 1.3 Defining O-notation
- 1.4 Properties of O-notation
- 2.1 Greedy Algorithms
- 2.2 Interval correctness proof
- 2.3 The Bridges of K¨onigsberg
- 2.4 When does a graph have a euler walk
- 3.1 Directed Euler Walks
- 3.2 Hamilton Cycles
- 3.3 Shaking Hands
- 3.4 Trees
- 4.1 Graph representations
- 4.2 Depth first search
- 4.3 Breadth first search
- 4.4 Dijkstra’s algorithm
- 5.1 Matchings Definitions
- 5.2 Finding maximum matchings
- 5.3 Prims Algorithm
- 5.4 Kruskal's algorithm
- 6.1 Making Kruskal's fast
- 6.2 The union-find data structure
- 6.3 2-3-4 Trees I
- 6.4 2-3-4 Trees II
- 7.1 Linear Programming
- 7.2 How to solve linear programs
- 7.3 Flow Networks
- 7.4 The Ford-Fulkerson algorithm
- 8.1 Why the Ford-Fulkerson algorithm looks so familiar
- 8.2 Applications of Ford-Fulkerson
- 8.3 SAT and NP
- 8.4 NP-completeness and 3-SAT
- 9.1 Independent sets and vertex covers
- 9.3 NP vs Co-NP
- 9.4 Dealing with NP-hard problems
- 10.1 Weighted Interval Scheduling
- 10.2 Dynamic Programming
- 10.3 The Bellman-Ford Algorithm
- 10.4 The Real Bellman-Ford algorithm
- Untitled Deck
