English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

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

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.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Koprowski, Przemysław1, Author
Mehlhorn, Kurt2, Author           
Ray, Saurabh1, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20172018
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1016/j.jsc.2017.05.008
BibTex Citekey: Koprowski2018
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Symbolic Computation
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Amsterdam : Elsevier
Pages: - Volume / Issue: 87 Sequence Number: - Start / End Page: 238 - 241 Identifier: ISSN: 0747-7171