Efficient Algorithms for Listing Combinatorial Structures - Brossura

Goldberg, Leslie

Brossura

ISBN 10: 0521117887 ISBN 13: 9780521117883

Casa editrice: Cambridge University Press, 2009

Riassunto

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

Su questo libro

Recensione

"...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

Descrizione del libro

First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2009
• Lingua: Inglese
• ISBN 10: 0521117887
• ISBN 13: 9780521117883
• Rilegatura: Copertina flessibile
• Numero edizione: 1
• Numero di pagine: 180
• Contatto del produttore: non disponibile