Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft GLS point 1 390 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 790 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Efficient Algorithms for Listing Combinatorial Structures

Name: Efficient Algorithms for Listing Combinatorial Structures
Brand: Cambridge University Press
SKU: 02031294
Price: 56091 HUF
Availability: InStock
Author: Leslie Ann Goldberg
ISBN: 9780521450218

Leslie Ann Goldberg

Language

English

Book Hardback

Libristo code: 02031294

Publishers Cambridge University Press, April 1993

First published in 1993, this thesis is concerned with the design of efficient algorithms for listin... Full description

Libristo code: 02031294

383 b

56 091 Ft

In stock at our supplier Shipping in 9-15 days

30-day return policy

Customers also purchased

Gulag a Československo Válka Adam Hradilek

Hardback

9 013 Ft

Verschwender Ferdinand Raimund

Paperback

4 543 Ft

Un juego peligroso. Kiss me like you love me 2 Shell

MP3

5 070 Ft

FACULTATIVO ESPECIALISTA MEDICO/A OSAKIDETZA-SERVICIO VAS 7 EDITORES

Paperback

7 682 Ft

Případ pro veverku v kole Slávka Poberová

Paperback

1 262 Ft

100 massage et activités de relaxation avec mon bébé Gilles Diedrichs

Paperback

6 068 Ft

HISTORIA DEL CINE JOSE LUIS SANCHEZ NORIEGA

Hardback

14 083 Ft

EL MALEFICIO DE LA PRINCESA ANTONIO A. GOMEZ YEBRA

Paperback

5 731 Ft

Vom PCI zum PDS - Die Sozialdemokratisierung der italienischen kommunistischen Partei Petra Buß

Paperback

6 272 Ft

Ernährungsratgeber Morbus Crohn und Colitis ulcerosa Sven-David Müller

Paperback

5 934 Ft

Essai Sur Le Vocalisme Du Sogdien. These Complementaire Pour Le Doctorat Es Lettres Presentee Gauthiot-R

Paperback

7 034 Ft

Einkaufen und Freizeit - Synergie- und Kopplungseffekte zwischen neuen Einkaufszentren und ihrem Umfeld Markus Wotruba

Paperback

25 577 Ft

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.