Pages that link to "Item:Q2464331"
From MaRDI portal
The following pages link to The complexity of polynomial-time approximation (Q2464331):
Displaying 11 items.
- Confronting intractability via parameters (Q465686) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- On the parameterized complexity of monotone and antimonotone weighted circuit satisfiability (Q1680511) (← links)
- Succinct monotone circuit certification: planarity and parameterized complexity (Q2019496) (← links)
- Succinct certification of monotone circuits (Q2232601) (← links)
- Safe Approximation and Its Relation to Kernelization (Q2891346) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- (Q3792916) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
