Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree (Q7330274)
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 from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deterministic Polynomial-time Exact-root Computation for Sparse Polynomials with Bounded Total Degree |
scientific article from arXiv |
Statements
cs.DS
0 references
2026
0 references
