Open AccessAnalytic analysis of algorithms
Author(s) -
Philippe Flajolet
Publication year - 1992
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
ISBN - 3-540-55719-9
DOI - 10.1007/3-540-55719-9_74
Subject(s) - enumeration , computer science , combinatorial explosion , algorithm , range (aeronautics) , combinatorial analysis , sorting , theoretical computer science , analysis of algorithms , asymptotic analysis , mathematics , discrete mathematics , combinatorics , composite material , mathematical analysis , materials science
The average case analysis of algorithms can avail itself of the development of synthetic methods in combinatorial enumerations and in asymptotic analysis. Symbolic methods in combinatorial analysis permit to express directly the counting generating functions of wide classes of combinatorial structures. Asymptotic methods based on complex analysis permit to extract directly coefficients of structurally complicated generating functions without a need for explicit coefficient expansions.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom