Corrigendum to “Faster algorithms for computing Hong's bound on absolute 
positiveness” [J. Symb. Comput. 45 (2010) 677–683]

Koprowski, Przemysław; Mehlhorn, Kurt; Ray, Saurabh

doi:10.1016/j.jsc.2017.05.008

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Corrigendum to “Faster algorithms for computing Hong's bound on absolute positiveness” [J. Symb. Comput. 45 (2010) 677–683]

MPS-Authors

/persons/resource/persons45021

Mehlhorn, Kurt
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

Koprowski, P., Mehlhorn, K., & Ray, S. (2018). Corrigendum to “Faster algorithms for computing Hong's bound on absolute positiveness” [J. Symb. Comput. 45 (2010) 677–683]. Journal of Symbolic Computation, 87, 238-241. doi:10.1016/j.jsc.2017.05.008.

Cite as: https://hdl.handle.net/21.11116/0000-0001-3C55-D

Abstract

There is no abstract available