A note on the best-case complexity
From MaRDI portal
Publication:1120281
DOI10.1016/0020-0190(89)90131-2zbMath0672.68019OpenAlexW2012736284MaRDI QIDQ1120281
Sheila A. Greibach, José D. P. Rolim
Publication date: 1989
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(89)90131-2
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Cites Work