Efficiently Computing Real Roots of Sparse Polynomials

Jindal, Gorav; Sagraloff, Michael

doi:10.1145/3087604.3087652

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Efficiently Computing Real Roots of Sparse Polynomials

MPS-Authors

/persons/resource/persons123330

Jindal, Gorav
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/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

Jindal, G., & Sagraloff, M. (2017). Efficiently Computing Real Roots of Sparse Polynomials. In ISSAC’17 (pp. 229-236). New York, NY: ACM. doi:10.1145/3087604.3087652.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002D-FBA6-4

Abstract

There is no abstract available