Login / Signup
Corrigendum to "Faster algorithms for computing Hong's bound on absolute positiveness" [J. Symb. Comput. 45 (2010) 677-683].
Przemyslaw Koprowski
Kurt Mehlhorn
Saurabh Ray
Published in:
J. Symb. Comput. (2018)
Keyphrases
</>
worst case
highly efficient
graph theory
computational cost
error bounds
times faster
benchmark datasets
worst case analysis
convergence rate
recently developed
combinatorial optimization
real time
theoretical analysis
upper bound
computational complexity
search algorithm
knowledge base