EFFICIENT ALGORITHMS FOR LISTING COMBINATORIAL STRUCTURES (PB 2009): 5 | by Leslie Ann Goldberg | Goldberg Leslie Ann | ‎ CAMBRIDGE UNIVERSITY PRESS | ‎ English | ‎ 1st Edition

Product description Review "...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 Book Description First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.