Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Peter G. Anderson / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Michael R. Garey / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Lee E. Heindel / rank | |||
Normal rank | |||
Revision as of 04:01, 22 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computational aspects of deciding if all roots of a polynomial lie within the unit circle |
scientific article |
Statements
Computational aspects of deciding if all roots of a polynomial lie within the unit circle (English)
0 references
1976
0 references
