# Advanced Computational Complexity-Lecture 14 Slides-Computer Science

Dichotomies and Intermediate Problem, Interesting Questions, NP as Polynomial, NP-complete, Ladner’s Theorem, NP-intermediate, Three Old Problems, P?=NP, Linear Programming, Primes/Composite, Graph Isomorphism, Dichotomy Problem, MMSNP, Constraint...

# Advanced Computational Complexity-Lecture 05 Slides-Computer Science

The Cook-levin Theorem, Advanced Computational Complexity, NP-complete, Polynomial Time, Assumptions About NT, Variables, Formula, Satisfiability, Satisfiability is NP-complete, About NT,Complexity

# Advanced Computational Complexity-Lecture 04 Slides-Computer Science

The Class NP, Beyond P, 2-Satisfiability, 2-Colourability, Polynomial Time Algorithms, Certificates, Satisfiability, K-colourability, Hamiltonian Circuit, Travelling Salesperson, Verifiers, Acceptor, Composite Number, Subset Sum, No Hamiltonian Ci...

# Advanced Computational Complexity-Lecture 07 Slides-Computer Science

NP-completeness, Hamiltonian Circuit, 3-Satisfiability, Encoding, CNF-formula, Consistency, Choice Gadget, Consistency Gadget, Constraint Gadget, Properties of Gadgets, Traversed, Communicating Truth Value to Several Triangles, General Constructio...

# Advanced Computational Complexity-Lecture 14 Slides-Computer Science

Dichotomies and Intermediate Problem, Interesting Questions, NP as Polynomial, NP-complete, Ladner’s Theorem, NP-intermediate, Three Old Problems, P?=NP, Linear Programming, Primes/Composite, Graph Isomorphism, Dichotomy Problem, MMSNP, Constraint...

# Advanced Computational Complexity-Lecture 05 Slides-Computer Science

The Cook-levin Theorem, Advanced Computational Complexity, NP-complete, Polynomial Time, Assumptions About NT, Variables, Formula, Satisfiability, Satisfiability is NP-complete, About NT,Complexity

# Advanced Computational Complexity-Lecture 04 Slides-Computer Science

The Class NP, Beyond P, 2-Satisfiability, 2-Colourability, Polynomial Time Algorithms, Certificates, Satisfiability, K-colourability, Hamiltonian Circuit, Travelling Salesperson, Verifiers, Acceptor, Composite Number, Subset Sum, No Hamiltonian Ci...

# Advanced Computational Complexity-Lecture 03 Slides-Computer Science

The Class P, Time Complexity, The Big–Oh Notation, Complexity Classes, P=doable, Tractable, Lemma, Different Encodings, Robustness of P, Polynomial Time Algorithm, Brute-force Search, CNF, Logical Formulas, Satisfiability, Proposition, Polynomial-...

# Advanced Computational Complexity-Lecture 19 Slides-Computer Science

Randomized Complexity, Polynomial Hierarchy, BPP, Polynomial Probabilistic Turing Machine, Complexity Classes, Efficient Random Algorithm, Efficient Deterministic Algorithm, Proof, NP-complete, Complexity, Turing Machine, Random Algorithm

# Advanced Computational Complexity-Lecture 18 Slides-Computer Science

The Polynomial Hierarchy and Randomized Computation, Deciding Satisfiability, NP-complete, PSpace-complete, Deciding Satisfiability, Polynomial Hierarchy, Hierarchy Collapse, Probabilistic Turing Machines, RP and CoRP, RP is in NP, The Constant,...

# Advanced Computational Complexity-Lecture 17 Slides-Computer Science

Approximation, Amplification, Amplifies, Consistency, Properties of the Instance of Clique, Properties of the Reduction, Approximation Schemes, Polynomial Approximation Scheme, PAS, Minimum Partition, Analysis, FPAS, Truncating, FPAS for Minimum P...

# Advanced Computational Complexity-Lecture 16 Slides-Computer Science

Hardness of Approximation, Relative Error, Approximate Solution, Maximisation Problem, Minimisation Problem, Reminder: Approximating Algorithms, Gap-TSP[?], Gap-TSP[?] and Approximability, Gap-TSP[?] is NP-hard, Hardness of Gap Problems, Decision...

# Advanced Computational Complexity-Lecture 15 Slides-Computer Science

Optimisation and Approximation, Optimisation Problems, Decision Problems, Minimum Vertex Cover, Maximum Clique, NP-hard, NP-complete, P=NP., Max 2-Sat is NP-hard, Relative Error, Maximisation Problem, Minimisation Problem, Approximating Algorithms...