The NP-completeness column: An ongoing guide
DOI10.1016/0196-6774(84)90010-5zbMath0562.68031OpenAlexW4243504551MaRDI QIDQ5902702
Publication date: 1984
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(84)90010-5
schedulingcommunication networksparallel computingparallel processingdistributed computingcommunication complexitycommunicating processesprimitive semaphores
Analysis of algorithms and problem complexity (68Q25) Problem books (00A07) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of operating systems (68N25)
Related Items (1)
This page was built for publication: The NP-completeness column: An ongoing guide