# Semidefinite programming and arithmetic circuit evaluation

@article{Tarasov2008SemidefinitePA,
title={Semidefinite programming and arithmetic circuit evaluation},
author={S. Tarasov and M. Vyalyi},
journal={ArXiv},
year={2008},
volume={abs/cs/0512035}
}
• Published 2008
• Computer Science, Mathematics
• ArXiv
• We address the exact semidefinite programming feasibility problem (SDFP) consisting in checking that intersection of the cone of positive semidefinite matrices and some affine subspace of matrices with rational entries is not empty. SDFP is a convex programming problem and is often considered as tractable since some of its approximate versions can be efficiently solved, e.g. by the ellipsoid algorithm. We prove that SDFP can decide comparison of numbers represented by the arithmetic circuits, i… CONTINUE READING
13 Citations

#### Topics from this paper

On the computing power of +, -, and ×
• M. Mamino
• Mathematics, Computer Science
• CSL-LICS
• 2014
• 1
Algorithms in Real Algebraic Geometry: A Survey
• S. Basu
• Computer Science, Mathematics
• ArXiv
• 2014
• 24
• PDF
Constraint Satisfaction Problems over Numeric Domains
• Computer Science
• The Constraint Satisfaction Problem
• 2017
• 9
• PDF
Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions
• Computer Science, Mathematics
• 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
• 2019
• 1
• PDF
On the complexity of numerical analysis
• Mathematics, Computer Science
• 21st Annual IEEE Conference on Computational Complexity (CCC'06)
• 2006
• 154
• PDF

#### References

SHOWING 1-10 OF 35 REFERENCES
On the Complexity of Semidefinite Programs
• Mathematics, Computer Science
• J. Glob. Optim.
• 1997
• 83
Handbook of Semidefinite Programming
• Computer Science
• 2000
• 672
• PDF
Complexity and Real Computation
• L. Blum
• Mathematics, Computer Science
• Springer New York
• 1998
• 1,414
• PDF
Completeness classes in algebra
• 509
Valiant’s model and the cost of computing integers
• P. Koiran
• Mathematics, Computer Science
• computational complexity
• 2004
• 32
• PDF