Quantifier elimination: Optimal solution for two classical examples (Q1104314): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/jsc/Lazard88, #quickstatements; #temporary_batch_1731483406851 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3216141 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A solution to Kahan's problem (SIGSAM problem no. 9) / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5723265 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/jsc/Lazard88 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Quantifier elimination: Optimal solution for two classical examples |
scientific article |
Statements
Quantifier elimination: Optimal solution for two classical examples (English)
0 references
1988
0 references
Two equivalent quantifier-free formulas corresponding to the following two problems are given: \((1)\quad (\forall x)P(x)\geq 0,\) where P(x) is a polynomial of degree 4, \((2)\quad (\forall x)(\forall y)E(x,y)=0\Rightarrow C(x,y)\leq 0,\) where E(x,y) and C(x,y) are the ellipse and, respectively, unit circle expressions. The solutions are elegant and need elementary calculus.
0 references
quantifier elimination
0 references
positive polynomial problem
0 references
ellipse problem
0 references
