CSCI3160 · 4
Chapter outline · Reductions and NP-completeness
Definitions and theorem statements recorded in the web, in note order, with the exact proof steps behind their recorded connections.
0 of 6 public sections have indexed statements. This outline covers only those statements, not every theorem in the chapter. Recorded connections are still being reviewed.
Polynomial reductions and NP-completeness
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
From Boolean formulas to 3-SAT
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
A reduction from 3-SAT to three-coloring
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
A reduction from 3-SAT to subset sum
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Hamiltonian paths, cycles and traveling-salesperson reductions
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.
Approximation algorithms: vertex cover and set cover
0 recorded theorems · 0 recorded definitions
Statements from this section are not indexed yet. Read the original note for its definitions and theorems.