𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complexity Estimates for the Schmüdgen Positivstellensatz

✍ Scribed by Gilbert Stengle

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
171 KB
Volume
12
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity Estimates for Representations
Complexity Estimates for Representations of Schmüdgen Type
✍ Elizabeth Mauch 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Let F={f 1 , ..., f j } and let K be a closed basic set in R n given by the polynomial inequalities f 1 \ 0, ..., f j \ 0. Let S{F} be the semiring generated by the f k and the squares in R[x 1 , ..., x n ]. For example, if F={f 1 } then S{F}=s 1 +s 2 f 1 , where s 1 , s 2 are sums of squares of pol

A new result on the complexity of heuris
A new result on the complexity of heuristic estimates for the A★ algorithm
✍ Othar Hansson; Andrew Mayer; Marco Valtorta 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 736 KB

Hansson, O., A. Mayer and M. Valtorta, A new result on the complexity of heuristic estimates for the A \* algorithm, Artificial Intelligence 55 (1992) 129-143. Relaxed models are abstract problem descriptions generated by ignoring constraints that are present in base-level problems. They play an im