Articoli correlati a Efficient Algorithms for Listing Combinatorial Structures
Sinossi
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 68,32
GRATIS per la spedizione da U.S.A. a Italia
Destinazione, tempi e costi
Risultati della ricerca per Efficient Algorithms for Listing Combinatorial Structures
Foto dell'editore
Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science, Series Number 5)
Editore:
Cambridge University Press, 1993
ISBN 10: 0521450217
ISBN 13: 9780521450218
Antico o usato
Rilegato
Da: Phatpocket Limited, Waltham Abbey, HERTS, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: Acceptable. Used - Acceptable. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library with wear and barcode page may have been removed. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. Codice articolo Z1-C-067-03792
Quantità: 1 disponibili
Immagini fornite dal venditore
Efficient algorithms for listing combinatorial structures.
Editore:
Cambridge University Press, 1993
ISBN 10: 0521450217
ISBN 13: 9780521450218
Antico o usato
Rilegato
Da: Antiquariat Bookfarm, Löbnitz, Germania
Valutazione del venditore 5 su 5 stelle
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. 9780521450218 Sprache: Englisch Gewicht in Gramm: 990. Codice articolo 2340186
Quantità: 1 disponibili
Foto dell'editore
EFFICIENT ALGORITHMS FOR LISTING COMBINATORIAL STRUCTURES (DISTINGUISHED DISSERTATIONS IN COMPUTER SCIENCE)
Da: Basi6 International, Irving, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Codice articolo ABEJUNE24-103139
Quantità: 1 disponibili
Foto dell'editore
Efficient Algorithms for Listing Combinatorial Structures (Distinguished Dissertations in Computer Science, Series Number 5)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521450218_new
Quantità: Più di 20 disponibili
Foto dell'editore
Efficient Algorithms for Listing Combinatorial Structures
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 160 pages. 10.25x7.25x0.50 inches. In Stock. This item is printed on demand. Codice articolo __0521450217
Quantità: 1 disponibili
Immagini fornite dal venditore
Efficient Algorithms for Listing Combinatorial Structures
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 c. Codice articolo 446936000
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Efficient Algorithms for Listing Combinatorial Structures
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Codice articolo 9780521450218
Quantità: 1 disponibili
Foto dell'editore
Efficient Algorithms for Listing Combinatorial Structures
Print on DemandDa: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 520. Codice articolo C9780521450218
Quantità: Più di 20 disponibili
Foto dell'editore
Efficient Algorithms for Listing Combinatorial Structures (Hardcover)
Editore:
Cambridge University Press, Cambridge, 1993
ISBN 10: 0521450217
ISBN 13: 9780521450218
Nuovo
Rilegato
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: new. Hardcover. 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 Polya's cycle polynomial is demonstrated. This thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521450218
Quantità: 1 disponibili
Foto dell'editore
Efficient Algorithms for Listing Combinatorial Structures
Editore:
Cambridge University Press CUP, 1993
ISBN 10: 0521450217
ISBN 13: 9780521450218
Nuovo
Rilegato
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. pp. 178. Codice articolo 26440280
Quantità: 4 disponibili