The completeness problem in the class of polynomials is resolvable (Q705701)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The completeness problem in the class of polynomials is resolvable |
scientific article; zbMATH DE number 2133875
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The completeness problem in the class of polynomials is resolvable |
scientific article; zbMATH DE number 2133875 |
Statements
The completeness problem in the class of polynomials is resolvable (English)
0 references
14 February 2005
0 references
0.8201836347579956
0 references
0.7885958552360535
0 references
