40,00 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
  • Broschiertes Buch

Restarting is a technique employed by many algorithms. For some problems, restarts improve the runtimes by orders of magnitude. This thesis considers several aspects of restarts. In addition to complexity-theoretical properties, we also study methods for constructing optimal restart strategies. On the practical side, we apply restarts to significantly improve the performance of a SAT solver.

Produktbeschreibung
Restarting is a technique employed by many algorithms. For some problems, restarts improve the runtimes by orders of magnitude. This thesis considers several aspects of restarts. In addition to complexity-theoretical properties, we also study methods for constructing optimal restart strategies. On the practical side, we apply restarts to significantly improve the performance of a SAT solver.
Autorenporträt
Jan-Hendrik Lorenz completed his Bachelor's and Master's studies at Ulm University. He conducted his doctoral studies at the Institute for Theoretical Computer Science at Ulm University. Of his published works, a total of three were awarded the Best Student Paper Award.