Pages that link to "Item:Q692893"
From MaRDI portal
The following pages link to Structure of polynomial-time approximation (Q692893):
Displaying 8 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Shortcutting directed and undirected networks with a degree constraint (Q507583) (← links)
- Polynomial time approximation schemes and parameterized complexity (Q867860) (← links)
- Structures computable in polynomial time. I (Q2401536) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- Towards and syntactic characterization of PTAS (Q4228486) (← links)
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311124) (← links)