Feasibility testing for systems of real quadratic equations

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 126-132

  Barvinok, Alexander I ^a  

^a SECHENOV INSTITUTE OF EVOLUTIONARY PHYSIOLOGY AND BIOCHEMISTRY   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIALS; ALGEBRA; ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; NONLINEAR EQUATIONS; SYSTEMS ANALYSIS; TESTING;

FEASIBILITY TESTING; GENERAL SYSTEMS; HOMOGENEOUS EQUATIONS; NONTRIVIAL SOLUTION; POLYNOMIAL EQUATION; QUADRATIC EQUATIONS;

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

FEASIBILITY TESTING; INEQUALITIES; QUADRATIC EQUATIONS;

EID: 0026991170     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129725     Document Type: Conference Paper

References (12)

1. R.Azencott, Simulated annealing, Astérisque, 161-162(1988), 223-237.
2. A.I.Barvinok, Method of statistical sums in combinatorial optimization problems (Russian), Algebra i analiz, 2(1990), N 5, 63-79
3. translated in Leningrad Mathematical Journal, 2(1991), 987-1002.
4. AJ.Barvinok, A.M.Vershik, Polynomially computable approximation of families of semi-algebraic sets and combinatorial complexity (Russian), in: Trudy Leningradskogo Matematicheskogo Obshestva, vol. 1, Leningrad State University, 1990, 826
5. to be translated in Proceedings of the Leningrad Mathematical Society, 1992.
6. J.Bochnak, M.Coste, M.-F.Roy, Geometrie Algébrique Reelle, Ergebnisse der Mathematik und ihrer Grenzgeibiete, Springer, 1988.
7. I.M.Gessel, Two theorems on rational power series, Militas Mathematica, 19(1981), 247-254.
8. D.Yu.Grigor'ev, N.N.Vorobjov, Solving systems of polynomial inequalities in subexponential time, J. Symb. Computation, 5(1988), NN 1-2, 37-64.
9. J.Hadamard, Cours D'Analyse, vol. 1, Hermann, Paris, 1927.
10. P.R.Haimos, A Hilbert Space Problem Book, Van Nostrana, London, 1967.
11. R.P.Stanley, Differentiably finite power series, Europ. J. Combinatorics, 1(1980), 175-188.
12. A.M.Vershik, On topological questions of real complexity theory and combinatorial optimization, preprint, DIMACS, TR 90-33, 1990.