The NP-completeness column: An ongoing guide
From MaRDI portal
Publication:4747510
DOI10.1016/0196-6774(83)90038-XzbMath0509.68034MaRDI QIDQ4747510
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Problem books (00A07) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
The complexity of analog computation ⋮ On the embedding of cone graphs in the line with distinct distances between neighbors
This page was built for publication: The NP-completeness column: An ongoing guide