Pages that link to "Item:Q3747719"
From MaRDI portal
The following pages link to Computation complexity of the range of a polynomial in several variables (Q3747719):
Displaying 6 items.
- Polytope-based computation of polynomial ranges (Q426184) (← links)
- Fuzzy constraint networks for signal pattern recognition (Q814488) (← links)
- Simulation of discrete linear time-invariant fuzzy dynamic systems (Q835082) (← links)
- On the complexity of the computation of certain classes of polynomials of several variables (Q1111380) (← links)
- A combined method for enclosing all solutions of nonlinear systems of polynomial equations (Q1899456) (← links)
- A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems (Q1904322) (← links)