Computation complexity of the range of a polynomial in several variables
From MaRDI portal
Publication:3747719
DOI10.1007/BF01070595zbMath0608.68028MaRDI QIDQ3747719
Publication date: 1985
Published in: Cybernetics (Search for Journal in Brave)
interval analysis; NP-hard; relative accuracy; absolute accuracy; interval of values of a polynomial; multi-variable polynomial
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
65G30: Interval and finite arithmetic
Related Items
Polytope-based computation of polynomial ranges, Fuzzy constraint networks for signal pattern recognition, Simulation of discrete linear time-invariant fuzzy dynamic systems, A combined method for enclosing all solutions of nonlinear systems of polynomial equations, A bright side of NP-hardness of interval computations: Interval heuristics applied to NP-problems
Cites Work