Pages that link to "Item:Q1869604"
From MaRDI portal
The following pages link to Range estimation is NP-hard for \({\varepsilon}^{2}\) accuracy and feasible for \({\varepsilon}^{2-\delta}\) (Q1869604):
Displaying 4 items.
- Why intervals? Because if we allow other sets, tractable problems become intractable (Q1276136) (← links)
- The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data (Q1623689) (← links)
- On a refined analysis of some problems in interval arithmetic using real number complexity theory (Q1826441) (← links)
- Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization (Q1874064) (← links)