Pages that link to "Item:Q4009694"
From MaRDI portal
The following pages link to Polynomial-time self-reducibility: theoretical motivations and practical results<sup>∗</sup> (Q4009694):
Displaying 5 items.
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- Obstruction set isolation for the gate matrix layout problem (Q1336625) (← links)
- New limits of treewidth-based tractability in optimization (Q2118087) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- LP Formulations for Polynomial Optimization Problems (Q4637509) (← links)