PosSLP and sum of squares
From MaRDI portal
Cites work
- A problem that is easier to solve on the unit-cost algebraic RAM
- Beweis für die Darstellbarkeit der ganzen Zahlen durch eine feste Anzahl n-ter Potenzen (Waringsches Problem).
- Bounds for Hilbert's irreducibility theorem
- Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets
- Discovering the roots: uniform closure results for algebraic classes under factoring
- scientific article; zbMATH DE number 3145302 (Why is no real title available?)
- scientific article; zbMATH DE number 5608591 (Why is no real title available?)
- scientific article; zbMATH DE number 51347 (Why is no real title available?)
- scientific article; zbMATH DE number 1096865 (Why is no real title available?)
- scientific article; zbMATH DE number 7711607 (Why is no real title available?)
- On the Complexity of Numerical Analysis
- On the hardness of PosSLP
- On the Order of Power Series and the Sum of Square Roots Problem
- On the partition of positive integers in four classes according to the minimal number of squares needed to their additive composition
- On the representation of definite functions by squares.
- On uniform circuit complexity
- Real roots of univariate polynomials and straight line programs
- Sums of Three Squares
- Sur la représentation en somme de carrés des polynômes à une indéterminée sur un corps de nombres algébriques
- Théorème d'irréductibilité de Hilbert effectif
- Zur Verallgemeinerung des Bertrandschen Postulates, daß zwischen x und 2x stets Primzahlen liegen.
This page was built for publication: PosSLP and sum of squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263571)
