Cantitate/Preț
Produs

Efficient Algorithms for Listing Combinatorial Structures: Distinguished Dissertations in Computer Science, cartea 5

Autor Leslie Ann Goldberg
en Limba Engleză Paperback – 29 iul 2009
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. The research described here gives some answers to the following questions: which families of combinatorial structures have fast computer algorithms for listing their members? What general methods are useful for listing combinatorial structures? How can these be applied to those families which are of interest to theoretical computer scientists and combinatorialists? Amongst those families considered are unlabelled graphs, first order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colourable graphs. 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. In particular, the difficulty of evaluating Pólya's cycle polynomial is demonstrated.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 30727 lei  6-8 săpt.
  Cambridge University Press – 29 iul 2009 30727 lei  6-8 săpt.
Hardback (1) 76425 lei  6-8 săpt.
  Cambridge University Press – 21 apr 1993 76425 lei  6-8 săpt.

Din seria Distinguished Dissertations in Computer Science

Preț: 30727 lei

Nou

Puncte Express: 461

Preț estimativ în valută:
5883 6126$ 4881£

Carte tipărită la comandă

Livrare economică 14-28 februarie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521117883
ISBN-10: 0521117887
Pagini: 180
Dimensiuni: 170 x 244 x 10 mm
Greutate: 0.3 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Distinguished Dissertations in Computer Science

Locul publicării:Cambridge, United Kingdom

Cuprins

1. Introduction; 2. Techniques for listing combinatorial structures; 3. Applications to particular families of structures; 4. Directions for future work on listing; 5. Related results; 6. Bibliography.

Recenzii

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

Descriere

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