Computation complexity of the range of a polynomial in several variables

DOI10.1007/BF01070595zbMath0608.68028MaRDI QIDQ3747719

A. A. Gaganov

Publication date: 1985

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

interval analysisNP-hardrelative accuracyabsolute accuracyinterval of values of a polynomialmulti-variable polynomial

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Interval and finite arithmetic (65G30)

Related Items (5)

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 ⋮ Polytope-based computation of polynomial ranges ⋮ Fuzzy constraint networks for signal pattern recognition

Cites Work

• On computing the range of a rational function of n variables over a bounded region
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation complexity of the range of a polynomial in several variables