Bookmark and Share

Logic and Hard Computational Problems D


Aalto University


<p>Propositional logic and first-order logic. Formulas, models, validity, satisfiability; axioms and proofs, soundness and completeness; logic circuits. Computational hardness, reductions between problems, the classes P and NP; NP-completeness, the Cook-Levin Theorem.</p>

Back
Course dates
01 September 2025 - 13 November 2025
Course organizer
Petteri Kaski
Place/Venue
School of Science / Department of Computer Science
City
Country
Finland
Workload
5
Link
https://mycourses.aalto.fi/course/search.php?...