Computational Intractability
Autor Erik D. Demaine, William Gasarch Gasarchen Limba Engleză Hardback – 13 oct 2026
Preț: 602.25 lei
Preț vechi: 752.81 lei
-20% Precomandă
Puncte Express: 903
Carte nepublicată încă
Livrare prin curier în România Precomanda se expediază când titlul devine disponibil.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Doresc să fiu notificat când acest titlu va fi disponibil:
Se trimite...
Specificații
ISBN-13: 9780262550772
ISBN-10: 0262550776
Pagini: 600
Dimensiuni: 178 x 229 mm
Greutate: 0.57 kg
Editura: MIT Press Ltd
ISBN-10: 0262550776
Pagini: 600
Dimensiuni: 178 x 229 mm
Greutate: 0.57 kg
Editura: MIT Press Ltd
Notă biografică
Erik D. Demaine is Professor of Computer Science at MIT and a MacArthur Fellow. His previous books include Geometric Folding Algorithms and Games, Puzzles, and Computation.
William Gasarch is Professor of Computer Science at the University of Maryland, where his research focuses on complexity theory, combinatorics, and Ramsey Theory. His previous books include Problems with a Point and Mathematical Muffin Morsels.
MohammadTaghi Hajiaghayi is Jack and Rita G. Minker Professor of Computer Science at the University of Maryland. He is a Guggenheim Fellow, ACM Fellow, IEEE Fellow, AAAS Fellow, EATCS Fellow, and Blavatnik Honoree.
William Gasarch is Professor of Computer Science at the University of Maryland, where his research focuses on complexity theory, combinatorics, and Ramsey Theory. His previous books include Problems with a Point and Mathematical Muffin Morsels.
MohammadTaghi Hajiaghayi is Jack and Rita G. Minker Professor of Computer Science at the University of Maryland. He is a Guggenheim Fellow, ACM Fellow, IEEE Fellow, AAAS Fellow, EATCS Fellow, and Blavatnik Honoree.