Pages that link to "Item:Q1826441"
From MaRDI portal
The following pages link to On a refined analysis of some problems in interval arithmetic using real number complexity theory (Q1826441):
Displaying 6 items.
- Grey dynamic input-output analysis (Q837583) (← links)
- Optimal enclosure of quadratic interval functions (Q1276128) (← links)
- Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\) (Q1869604) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)
- (Q4266489) (← links)
- Complexity aspects of a semi-infinite optimization problem† (Q5449018) (← links)