Pages that link to "Item:Q2464331"
From MaRDI portal
The following pages link to The complexity of polynomial-time approximation (Q2464331):
Displaying 21 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Structure of polynomial-time approximation (Q692893) (← links)
- Most relevant explanation: Computational complexity and approximation methods (Q766267) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- On the complexity of approximating the Hadwiger number (Q1006087) (← 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)
- (Q4212463) (← links)
- Towards and syntactic characterization of PTAS (Q4228486) (← links)
- Complexity Approximation Principle (Q4933950) (← links)
- Four Shorts Stories on Surprising Algorithmic Uses of Treewidth (Q5042454) (← links)
- The Complexity of Approximating the Matching Polynomial in the Complex Plane (Q5065635) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)
- (Q5702337) (← links)
