Pages that link to "Item:Q5892165"
From MaRDI portal
The following pages link to When polynomial approximation meets exact computation (Q5892165):
Displaying 9 items.
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- Master-slave strategy and polynomial approximation (Q1588828) (← links)
- 4OR comes of age. Editorial note (Q2040603) (← links)
- Moderate exponential-time algorithms for scheduling problems (Q2095519) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- (Q3421276) (← links)
- Very accurate estimates of the polygamma functions (Q3589436) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- Preface (Q5970304) (← links)