Efficient Algorithms for Listing Combinatorial Structures

Goldberg Leslie Ann

ISBN 10: 0521450217 / ISBN 13: 9780521450218

Edité par Cambridge University Press, 1993

A propos de cet article

PRINT ON DEMAND pp. 178.

N° de réf. du vendeur 18440274

Détails bibliographiques

• Titre: Efficient Algorithms for Listing Combinatorial Structures
• Éditeur: Cambridge University Press
• Date de parution: 1993
• Langue: anglais
• ISBN à 10 chiffres: 0521450217
• ISBN à 13 chiffres: 9780521450218
• Reliure: Couverture rigide
• État de l'article: New

A propos de ce titre

Synopsis

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.

Revue de presse

"...selected as one of the three best theses in computer science in the UK in 1992....makes an important contribution to the complexity theory of listing and counting combinatorial structures....gives new and interesting results..." Mathematical Reviews

"By any standard, this is an exceptional dissertation. It is well written, with the author always explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture. The author has built up a substantial theory...." G.F. Royle, Computing Reviews

"...an impressive and thorough examination of listing problems in this framework...the complicated probabilistic arguments needed for the analysis are handled well...this is an exceptional dissertation...well-written, with the author always carefully explaining the thrust of the argument, never allowing the technical nature of many of the results to obscure the overall picture." G.F. Royle, Mathematics of Computing