Scalable Resolution of NP-hard Problems

  • Subject:Parallel and distributed algorithms, SAT Solving, automated planning
  • Type:Bachelor-/Masterarbeit
  • Supervisor:

    Dominik Schreiber

Description

Within the broad area of resolving combinatorial NP-hard problems in a scalable manner, changing topics are available on request in the following areas:

  • High Performance SAT Solving
  • "Malleabilization" of applications with combinatorial search space
  • Hierarchical Automated Planning

Details are provided in the PDF linked above.