Feasibility testing for systems of real quadratic equations

Authors:
Alexander I. Barvinok
Affiliations:
Mittag-Leffler Institute
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 1
Cited 1

Solving systems of polynomial inequalities in subexponential time

Journal of Symbolic Computation

Scale-Space Properties of Quadratic Feature Detectors

IEEE Transactions on Pattern Analysis and Machine Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of deciding whether a given system of quadratic homogeneous equations over the reals has non-trivial solution. We design an approximative algorithm whose complexity is polynomial in the number of variables and exponential in the number of equations. Some applications to general systems of polynomial equations and inequalities over the reals are discussed.