
Primal Pathwidth-Strong Exponential Time Hypothesis (PP-SETH) unifies fine-grained questions in parameterized complexity, showing equivalence and sharpening lower bounds.


coremsg

primal-pathwidth-seth-equivalence-and-complexity-hypothesis


Primal Pathwidth SETH: Equivalence and Complexity Hypothesis


title_rewrite


The author explores fundamental fine-grained questions in parameterized complexity, showing that they are all equivalent to the Primal Pathwidth-Strong Exponential Time Hypothesis (PP-SETH), indicating a meta-complexity property cutting across traditional complexity classes.


unveiling-the-primal-pathwidth-seth-fine-grained-complexity-questions-explored


Unveiling the Primal Pathwidth SETH: Fine-Grained Complexity Questions Explored
