{"title":"Erik D Demaine","description":null,"products":[{"product_id":"lifetime-of-puzzles-book-erik-d-demaine-9781568812458","title":"A Lifetime of Puzzles","description":"Martin Gardner has entertained the world with his puzzles for decades and inspired countless mathematicians and scientists. As he rounds out another decade, his colleagues are paying him tribute with this special collection that contains contributions from some of the most respected puzzlemasters, magicians and mathematicians, including: - John H. Conway - William R. Gosper - Ed Pegg, Jr. - Roger Penrose - Raymond Smullyan - Peter Winkler And of course there is something from the orignal puzzlemaster himself, Martin Gardner.","brand":"WoB","offers":[{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":50329239355665,"sku":"CIN1568812450VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":50980894015761,"sku":"GOR008826368","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ GOOD \/ SBYB","offer_id":53560962122001,"sku":"CIN1568812450G","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1568812450.jpg?v=1751087566"},{"product_id":"geometric-folding-algorithms-book-erik-d-demaine-9780521857574","title":"Geometric Folding Algorithms","description":"Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":50628619305233,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ LIKE_NEW \/ INTERNAL","offer_id":50628621074705,"sku":"GOR014016955","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52665548243217,"sku":"NLS9780521857574","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521857570.jpg?v=1751166480"},{"product_id":"geometric-folding-algorithms-book-erik-d-demaine-9780521715225","title":"Geometric Folding Algorithms","description":"Did you know that any straight-line drawing on paper can be folded so that the complete drawing can be cut out with one straight scissors cut? That there is a planar linkage that can trace out any algebraic curve, or even 'sign your name'? Or that a 'Latin cross' unfolding of a cube can be refolded to 23 different convex polyhedra? Over the past decade, there has been a surge of interest in such problems, with applications ranging from robotics to protein folding. With an emphasis on algorithmic or computational aspects, this treatment gives hundreds of results and over 60 unsolved 'open problems' to inspire further research. The authors cover one-dimensional (1D) objects (linkages), 2D objects (paper), and 3D objects (polyhedra). Aimed at advanced undergraduate and graduate students in mathematics or computer science, this lavishly illustrated book will fascinate a broad audience, from school students to researchers.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51430084575505,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":51430085034257,"sku":"GOR014272454","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52355233808657,"sku":"NLS9780521715225","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":52711265894673,"sku":"CIN0521715229VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ NEW \/ INGRAM","offer_id":52735461458193,"sku":"NIN9780521715225","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/0521715229.jpg?v=1751103779"},{"product_id":"lifetime-of-puzzles-book-erik-d-demaine-9780367386566","title":"A Lifetime of Puzzles","description":"Martin Gardner has entertained the world with his puzzles for decades and inspired countless mathematicians and scientists. As he rounds out another decade, his colleagues are paying him tribute with this special collection that contains contributions from some of the most respected puzzlemasters, magicians and mathematicians, including: - John H. Conway - William R. Gosper - Ed Pegg, Jr. - Roger Penrose - Raymond Smullyan - Peter Winkler And of course there is something from the orignal puzzlemaster himself, Martin Gardner.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52474671366417,"sku":"NLS9780367386566","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52858213204241,"sku":"NIN9780367386566","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780367386566.jpg?v=1759841523"},{"product_id":"computational-intractability-book-erik-d-demaine-9780262550772","title":"Computational Intractability","description":"\u003cb\u003eA practical guide to understanding the theory and practice of computational lower bounds.\u003c\/b\u003e\u003cbr\u003e \u003cbr\u003e A fundamental question in computer science is: \"Given a problem, how hard is it to solve?\" Usually, the answer to this question lies in determining how long it will take to solve a problem as a function of the length of the input. Yet this question has two different parts, with two different answers: (1) upper bounds, which show that a problem \u003ci\u003ecan\u003c\/i\u003e be solved in time \u003ci\u003eT\u003c\/i\u003e(\u003ci\u003en\u003c\/i\u003e), and (2) lower bounds, which show that a problem \u003ci\u003ecannot\u003c\/i\u003e be solved in time \u003ci\u003eT\u003c\/i\u003e(\u003ci\u003en\u003c\/i\u003e). In \u003ci\u003eComputational Intractability\u003c\/i\u003e, Erik Demaine, William Gasarch, and Mohammad Hajiaghayi focus on the latter, providing a guidebook to navigating lower bounds via the study of P, NP, NP-completeness, and other related notions.\u003cbr\u003e \u003cbr\u003e \u003ci\u003eComputational Intractability\u003c\/i\u003e covers virtually all aspects of lower bounds, from parallelism to undecidability, and explores this material from the point of view of actual problems rather than classes of problems. The authors show how to prove lower bounds on problems in a wide variety of settings: polynomial time, classes likely above polynomial time (e.g., polynomial space), and classes within polynomial time (e.g., quadratic time).","brand":"WoB","offers":[{"title":"GB \/ NEW \/ GARDNERS","offer_id":53506188607761,"sku":"NGR9780262550772","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9780262550772.jpg?v=1778320392"}],"url":"https:\/\/www.worldofbooks.com\/collections\/author-books-by-erik-d-demaine.oembed","provider":"World of Books ","version":"1.0","type":"link"}