Publication:4198056
zbMath0411.68039MaRDI QIDQ4198056
David S. Johnson, Michael R. Garey
Publication date: 1979
partitions; computational complexity; scheduling; puzzles; automata; graph theory; NP-completeness; sequencing; mathematical programming; network design; approximation algorithms; logic; games; storage; retrieval; languages; program optimization; algebra; number theory; polynomial solvable problems
68Q25: Analysis of algorithms and problem complexity
91A99: Game theory
05A17: Combinatorial aspects of partitions of integers
68Q45: Formal languages and automata
68R10: Graph theory (including graph drawing) in computer science
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
94C30: Applications of design theory to circuits and networks
68T99: Artificial intelligence
03D15: Complexity of computation (including implicit computational complexity)
68-02: Research exposition (monographs, survey articles) pertaining to computer science
94C15: Applications of graph theory to circuits and networks
68P20: Information storage and retrieval of data
90C99: Mathematical programming
68N99: Theory of software
Lua error: not enough memory.
