Pages that link to "Item:Q1368836"

The following pages link to Computing the topological degree with noisy information (Q1368836):

Displaying 4 items.

• On the complexity of isolating real roots and computing with certainty the topological degree (Q700184) (← links)
• How to minimize the cost of iterative methods in the presence of perturbations (Q1394939) (← links)
• The worst case complexity of the fredholm equation of the second kind with non-periodic free term and noise information (Q4400144) (← links)
• The worst case complexity of the fredholm equation with periodic free term and noisy information^∗ (Q4935386) (← links)