Skip to content 
el cat en
База данных: Electronic library
Page 1, Results: 2
Отмеченные записи: 0
1.
Подробнее
T 44
The Best Writing on Mathematics. / editor. Pitici, Mircea,.
2021 /. - Princeton : : Princeton University Press,, [2022]. - 1 online resource (320 pages). - URL: https://library.dvfu.ru/lib/document/SK_ELIB/330C9E1C-C807-4902-B5FE-79396A192587. - ISBN 0691225729 (electronic book). - ISBN 9780691225722 (electronic bk.)
Online resource; title from digital title page (viewed on August 05, 2022).
Параллельные издания: Print version: : Pitici, Mircea. Best Writing on Mathematics 2021. - Princeton : Princeton University Press, ©2022. - ISBN 9780691225715
~РУБ DDC 510.5
Рубрики: Mathematics.
MATHEMATICS--General.
Mathematics.
Аннотация: The year's finest mathematical writing from around the worldThis annual anthology brings together the year's finest mathematics writing from around the world--and you don't need to be a mathematician to enjoy the pieces collected here. These essays--from leading names and fresh new voices--delve into the history, philosophy, teaching, and everyday aspects of math, offering surprising insights into its nature, meaning, and practice, and taking readers behind the scenes of today's hottest mathematical debates.Here, Viktor Blåsjö gives a brief history of "lockdown mathematics"; Yelda Nasifoglu decodes the politics of a seventeenth-century play in which the characters are geometric shapes; and Andrew Lewis-Pye explains the basic algorithmic rules and computational procedures behind cryptocurrencies. In other essays, Terence Tao candidly recalls the adventures and misadventures of growing up to become a leading mathematician; Natalie Wolchover shows how old math gives new clues about whether time really flows; and David Hand discusses the problem of "dark data"--information that is missing or ignored. And there is much, much more.
Доп.точки доступа:
Pitici, Mircea, \editor.\
T 44
The Best Writing on Mathematics. / editor. Pitici, Mircea,.
2021 /. - Princeton : : Princeton University Press,, [2022]. - 1 online resource (320 pages). - URL: https://library.dvfu.ru/lib/document/SK_ELIB/330C9E1C-C807-4902-B5FE-79396A192587. - ISBN 0691225729 (electronic book). - ISBN 9780691225722 (electronic bk.)
Online resource; title from digital title page (viewed on August 05, 2022).
Параллельные издания: Print version: : Pitici, Mircea. Best Writing on Mathematics 2021. - Princeton : Princeton University Press, ©2022. - ISBN 9780691225715
Рубрики: Mathematics.
MATHEMATICS--General.
Mathematics.
Аннотация: The year's finest mathematical writing from around the worldThis annual anthology brings together the year's finest mathematics writing from around the world--and you don't need to be a mathematician to enjoy the pieces collected here. These essays--from leading names and fresh new voices--delve into the history, philosophy, teaching, and everyday aspects of math, offering surprising insights into its nature, meaning, and practice, and taking readers behind the scenes of today's hottest mathematical debates.Here, Viktor Blåsjö gives a brief history of "lockdown mathematics"; Yelda Nasifoglu decodes the politics of a seventeenth-century play in which the characters are geometric shapes; and Andrew Lewis-Pye explains the basic algorithmic rules and computational procedures behind cryptocurrencies. In other essays, Terence Tao candidly recalls the adventures and misadventures of growing up to become a leading mathematician; Natalie Wolchover shows how old math gives new clues about whether time really flows; and David Hand discusses the problem of "dark data"--information that is missing or ignored. And there is much, much more.
Доп.точки доступа:
Pitici, Mircea, \editor.\
2.
Подробнее
C 77
Cook, William, (1957-).
In pursuit of the traveling salesman : : mathematics at the limits of computation / / William J. Cook. - 6613339775. - Princeton : : Princeton University Press,, 2012. - 1 online resource (xiii, 228 pages) : : il, карты ( час. мин.), 6613339775. - English. - Includes bibliographical references and index. - URL: https://library.dvfu.ru/lib/document/SK_ELIB/6301DF58-F3D9-4525-B9C3-13C7354D6345. - ISBN 9781400839599 (electronic bk.). - ISBN 1400839599 (electronic bk.). - ISBN 1283339773. - ISBN 9781283339773. - ISBN 9786613339775. - ISBN 6613339776
Параллельные издания: Print version: :
Содержание:
Challenges. Tour of the United States -- An impossible task? -- One problem at a time -- Road map of the book -- Origins of the problem. Before the mathematicians -- Euler and Hamilton -- Vienna to Harvard to Princeton -- And on to the RAND Corporation -- A statistical view -- The salesman in action. Road trips -- Mapping genomes -- Aiming telescopes, x-rays, and lasers -- Guiding industrial machines -- Organizing data -- Tests for microprocessors -- Scheduling jobs -- And more -- Searching for a tour. The 48-states problem -- Growing trees and tours -- Alterations while you wait -- Borrowing from physics and biology -- The DIMACS challenge -- Tour champions -- Linear programming. General-purpose model -- The simplex algorithm -- Two for the price of one: LP duality -- The degree LP relaxation of the TSP -- Eliminating subtours -- A perfect relaxation -- Integer programming -- Operations research -- Cutting planes. The cutting-plane method -- A catalog of TSP inequalities -- The separation problem -- Edmonds's glimpse of heaven -- Cutting planes for integer programming -- Branching. Breaking up -- The search party -- Branch-and-bound for integer programming -- Big computing. World records -- The TSP on a grand scale -- Complexity. A model of computation -- The campaign of Jack Edmonds -- Cook's theorem and Karp's list -- State of the TSP -- Do we need computers? -- The human touch. Humans versus computers -- Tour-finding strategies -- The TSP in neuroscience -- Animals solving the TSP -- Aesthetics -- Julian Lethbridge -- Jordan curves -- Continuous lines -- Art and mathematics -- Pushing the limits.
~РУБ DDC 511/.5
Рубрики: Traveling salesman problem.
Computational complexity.
Vehicle routing problem.
Problèmes de tournées.
Complexité de calcul (Informatique)
MATHEMATICS--Graphic Methods.
MATHEMATICS--General.
Computational complexity.
Traveling salesman problem.
Аннотация: "What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W.R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem"--
C 77
Cook, William, (1957-).
In pursuit of the traveling salesman : : mathematics at the limits of computation / / William J. Cook. - 6613339775. - Princeton : : Princeton University Press,, 2012. - 1 online resource (xiii, 228 pages) : : il, карты ( час. мин.), 6613339775. - English. - Includes bibliographical references and index. - URL: https://library.dvfu.ru/lib/document/SK_ELIB/6301DF58-F3D9-4525-B9C3-13C7354D6345. - ISBN 9781400839599 (electronic bk.). - ISBN 1400839599 (electronic bk.). - ISBN 1283339773. - ISBN 9781283339773. - ISBN 9786613339775. - ISBN 6613339776
Параллельные издания: Print version: :
Содержание:
Challenges. Tour of the United States -- An impossible task? -- One problem at a time -- Road map of the book -- Origins of the problem. Before the mathematicians -- Euler and Hamilton -- Vienna to Harvard to Princeton -- And on to the RAND Corporation -- A statistical view -- The salesman in action. Road trips -- Mapping genomes -- Aiming telescopes, x-rays, and lasers -- Guiding industrial machines -- Organizing data -- Tests for microprocessors -- Scheduling jobs -- And more -- Searching for a tour. The 48-states problem -- Growing trees and tours -- Alterations while you wait -- Borrowing from physics and biology -- The DIMACS challenge -- Tour champions -- Linear programming. General-purpose model -- The simplex algorithm -- Two for the price of one: LP duality -- The degree LP relaxation of the TSP -- Eliminating subtours -- A perfect relaxation -- Integer programming -- Operations research -- Cutting planes. The cutting-plane method -- A catalog of TSP inequalities -- The separation problem -- Edmonds's glimpse of heaven -- Cutting planes for integer programming -- Branching. Breaking up -- The search party -- Branch-and-bound for integer programming -- Big computing. World records -- The TSP on a grand scale -- Complexity. A model of computation -- The campaign of Jack Edmonds -- Cook's theorem and Karp's list -- State of the TSP -- Do we need computers? -- The human touch. Humans versus computers -- Tour-finding strategies -- The TSP in neuroscience -- Animals solving the TSP -- Aesthetics -- Julian Lethbridge -- Jordan curves -- Continuous lines -- Art and mathematics -- Pushing the limits.
Рубрики: Traveling salesman problem.
Computational complexity.
Vehicle routing problem.
Problèmes de tournées.
Complexité de calcul (Informatique)
MATHEMATICS--Graphic Methods.
MATHEMATICS--General.
Computational complexity.
Traveling salesman problem.
Аннотация: "What is the shortest possible route for a traveling salesman seeking to visit each city on a list exactly once and return to his city of origin? It sounds simple enough, yet the traveling salesman problem is one of the most intensely studied puzzles in applied mathematics--and it has defied solution to this day. In this book, William Cook takes readers on a mathematical excursion, picking up the salesman's trail in the 1800s when Irish mathematician W.R. Hamilton first defined the problem, and venturing to the furthest limits of today's state-of-the-art attempts to solve it. Cook examines the origins and history of the salesman problem and explores its many important applications, from genome sequencing and designing computer processors to arranging music and hunting for planets. He looks at how computers stack up against the traveling salesman problem on a grand scale, and discusses how humans, unaided by computers, go about trying to solve the puzzle. Cook traces the salesman problem to the realms of neuroscience, psychology, and art, and he also challenges readers to tackle the problem themselves. The traveling salesman problem is--literally--a $1 million question. That's the prize the Clay Mathematics Institute is offering to anyone who can solve the problem or prove that it can't be done. In Pursuit of the Traveling Salesman travels to the very threshold of our understanding about the nature of complexity, and challenges you yourself to discover the solution to this captivating mathematical problem"--
Page 1, Results: 2