Parameterized Relaxations for Circuits and Graphs
Whatmakessomeproblemshardtosolve, and others easy? In situations where complexitytheoretic hypotheses rule out the possibility of fast algorithms for problems, are there nonetheless instances for which we can evade intractability and still design efficient algorithms? In this thesis, we investigate...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Published: |
Massachusetts Institute of Technology
2024
|
| Online Access: | https://hdl.handle.net/1721.1/156299 https://orcid.org/0000-0002-7266-2041 |