The following pages link to (Q5702337):
Displaying 9 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- The complexity of polynomial-time approximation (Q2464331) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- Polynomial approximation: a structural and operational study. (Abstract of thesis) (Q2644383) (← links)
- Complexity estimates depending on condition and round-off error (Q3158534) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- (Q4792309) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)