Constant time factors do matter
From MaRDI portal
Publication:5248531
DOI10.1145/167088.167244zbMath1310.68076OpenAlexW2073812497MaRDI QIDQ5248531
Publication date: 7 May 2015
Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/167088.167244
Data structures (68P05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
No NP problems averaging over ranking of distributions are harder ⋮ Tighter constant-factor time hierarchies
This page was built for publication: Constant time factors do matter