On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

Brand, Cornelius; Sagraloff, Michael

doi:10.1145/2930889.2930934

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection

MPS-Authors

/persons/resource/persons45332

Sagraloff, Michael
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Brand, C., & Sagraloff, M. (2016). On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection. In M. Rosenkranz (Ed.), ISSAC 2016 (pp. 151-158). New York, NY: ACM. doi:10.1145/2930889.2930934.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002B-02B2-E

Abstract

There is no abstract available