Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (Q287269)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6585552
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems |
scientific article; zbMATH DE number 6585552 |
Statements
Formally-verified decision procedures for univariate polynomial computation based on Sturm's and Tarski's theorems (English)
0 references
26 May 2016
0 references
nonlinear arithmetic
0 references
decision procedure
0 references
prototype verification system (PVS)
0 references
polynomial inequalities
0 references
Sturm's theorem
0 references
Tarski's theorem
0 references
automated theorem proving
0 references
interactive theorem proving
0 references
0 references
0 references
0 references
0.8942105174064636
0 references
0.7522775530815125
0 references
0.7070262432098389
0 references
0.7022992968559265
0 references
