https://jakub-oprsal.vercel.app/students/ Recent content in Students on jakub opršal Hugo -- gohugo.io en-gb Fri, 02 Feb 2024 09:54:53 +0000 https://jakub-oprsal.vercel.app/students/project-ideas/ Fri, 02 Feb 2024 09:54:53 +0000 https://jakub-oprsal.vercel.app/students/project-ideas/ I am working on computational complexity (mostly within the class NP), constraint satisfaction problems (CSPs), their approximation and optimisation, and underlying mathematics. The Constraint Satisfaction Problem is the problem of deciding whether a list of constraints over variables with (usually finite) domain can be satisfied simultaneously. This is a wide class of problems which includes, the Boolean SAT problem, linear programming, solving systems of equations, and many other problems. Some of these are NP-complete, and some are solvable efficiently in polynomial time.