Algorithm Design: A Methodological Approach - 150 problems and detailed solutions
Regular price
€64.99
14 days return policy
Shipping & Delivery
A01=Laurent Miclet
A01=Marc Guyomard
A01=Patrick Bosc
advanced computer science study
Algorithm
algorithmic complexity analysis
Asymptotic Time Complexity
Author_Laurent Miclet
Author_Marc Guyomard
Author_Patrick Bosc
Average Complexity
Bottom Triangle
Category=PBW
Category=UMB
Category=UMX
Category=UMZ
Category=UYA
combinatorial optimisation methods
computational problem solving
Convex Polygon
Design
discrete mathematics
Double Squares
Elementary Operation
Elementary Strokes
Elementary Triangle
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
Evaluation Function
exhaustive search algorithm techniques
Function Calc
Geometric Progression
Hamiltonian Cycle
Hamiltonian Path
Heuristic Function
Hilbert Curve
Induction Hypothesis
Inverted Triangle
Manhattan Distance
Maximum Complexity
Methodological
Pedagogical
Priority Queue
Problems
Queue OPEN
Recursive Call
recursive problem strategies
Reduction Model
Search Tree
Solutions
Uniform Cost
Product details
- ISBN 9781032369396
- Weight: 1460g
- Dimensions: 178 x 254mm
- Publication Date: 31 Jan 2023
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
A bestseller in its French edition, this book is original in its construction and its success in the French market demonstrates its appeal. It is based on three principles: (1) An organization of the chapters by families of algorithms: exhaustive search, divide and conquer, etc. On the contrary, there is no chapter devoted only to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. (2) For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. (3) For the most part, the book details 150 problems, spanning seven families of algorithms. For each problem, a precise and progressive statement is given. More importantly, a complete solution is detailed, with respect to the design principles that have been presented; often, some classical errors are pointed out. Roughly speaking, two-thirds of the book is devoted to the detailed rational construction of the solutions.
Patrick Bosc, Marc Guyomard, and Laurent Miclet are former professors at Enssat, Engineering school of University of Rennes, France and senior researchers at IRISA. They have taught Data Structures, Algorithmic, Databases, Formal methods, Language theory, Compiling, etc. for numerous years at the Bachelor and Master levels.
