Applied Computer Science II Chapter 4: Decidability Prof. Dr. Luc De Raedt Institut für Informatik Albert-Ludwigs Universität Freiburg Germany.
MELJUN CORTES Automata Theory (Automata20)
Complexity 7-1 Complexity Andrei Bulatov Complexity of Problems.
Complexity 5-1 Complexity Andrei Bulatov Complexity of Problems.
The Theory of NP-Completeness Tractable and intractable problems NP-complete problems.
1 91.304 Foundations of (Theoretical) Computer Science Chapter 4 Lecture Notes (Section 4.1: Decidable Languages) David Martin [email protected] With modifications.
David Evans cs.virginia/evans
The Theory of NP-Completeness
Computability Decidability
Computer Language Theory
David Evans
