A complete algorithm to find exact minimal polynomial by approximations (Q4902848)
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: A complete algorithm to find exact minimal polynomial by approximations |
scientific article; zbMATH DE number 6126694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A complete algorithm to find exact minimal polynomial by approximations |
scientific article; zbMATH DE number 6126694 |
Statements
A complete algorithm to find exact minimal polynomial by approximations (English)
0 references
18 January 2013
0 references
error controllable algorithm
0 references
symbolic-numerical computation
0 references
integer relation construction
0 references
minimal polynomial
0 references
0 references
0.9119508862495422
0 references
0.8795480132102966
0 references
0.7482666373252869
0 references
0.7432544231414795
0 references
0.7431389093399048
0 references
