scientific article; zbMATH DE number 3639144

zbMath0411.68039MaRDI QIDQ4198056

Michael R. Garey, David S. Johnson

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

partitionscomputational complexityschedulingpuzzlesautomatagraph theoryNP-completenesssequencingmathematical programmingnetwork designapproximation algorithmslogicgamesstorageretrievallanguagesprogram optimizationalgebranumber theorypolynomial solvable problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Game theory (91A99) Combinatorial aspects of partitions of integers (05A17) Formal languages and automata (68Q45) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of design theory to circuits and networks (94C30) Artificial intelligence (68T99) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Applications of graph theory to circuits and networks (94C15) Information storage and retrieval of data (68P20) Mathematical programming (90C99) Theory of software (68N99)