Pages that link to "Item:Q599498"

The following pages link to A note on the complexity of approximative evaluation of polynomials (Q599498):

Displaying 2 items.

• How many polynomials can be approximated faster than they can be evaluated? (Q1155959) (← links)
• Lower bound for the approximative complexity (Q1822498) (← links)