The NP-completeness column: An ongoing guide

DOI10.1016/0196-6774(83)90028-7zbMath0524.68029OpenAlexW4236289823MaRDI QIDQ5893829

David S. Johnson

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90028-7

zbMATH Keywords

serializabilitydeadlockdatabase concurrency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem books (00A07)

Related Items (2)

Deadlock-freedom (and safety) of transactions in a distributed database ⋮ Certain NP-complete matching problems

This page was built for publication: The NP-completeness column: An ongoing guide