On the complexity of Hilbert's 17th problem

DOI10.1007/978-3-540-30538-5_20MaRDI QIDQ5465857zbMATH OpenOpenAlexFDO

Authors Nikhil R. Devanur, Richard J. Lipton, Nisheeth K. Vishnoi

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)

Recommendations

• On Hilbert's 17th problem in low degree
• Positive polynomials. From Hilbert's 17th problem to real algebra
• scientific article; zbMATH DE number 421671
• On the absence of uniform denominators in Hilbert’s 17th problem
• Uniform denominators in Hilbert's seventeenth problem

Cited in

(8)

• On Hilbert's fourteenth problem for varieties of complexity one.
• On the complexity of the Leibniz hierarchy
• On the complexity of Hilbert refutations for partition
• On Hilbert's 17th problem in low degree
• Sums of squares on the hypercube
• Dependence on parameters in analogues of hilberts seventeenth problem
• An elementary recursive bound for effective Positivstellensatz and Hilbert's 17th problem
• Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions

This page was built for publication: On the complexity of Hilbert's 17th problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465857)