Teori Kompleksitas(Bagian 3)

Oleh: Rinaldi Munir

1Program Studi Magister Informatika STEI-ITB

IF5110 Teori Komputasi

Sumber: Complexity Theory, based on

Garey M., Johnson D.S., Computers and Intractability A guide to the Theory of NP-Completeness, Freeman and Company -New York - 2000

2

SAT• SAT = Satisfiability Problem

3

4

5

6

7

8

9

10

11

12

13

14

15