Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Zistiť stav objednávky

Staňte sa súčasťou komunity milovníkov kníh z celého sveta a získajte hromadu výhod. Založiť účet zdarma

Doprava zadarmo s Packetou nad 59.99 €

Kuriér DPD 2.99 € Zberné miesto GLS 2.99 € SPS 3.99 € Kuriér GLS 3.49 € SPS Parcel Shop 2.99 € Packeta kurýr 3.99 € Pošta 3.99 € Zberné miesto DPD 2.99 € Zberné miesto DPD 0.00 € Packeta 2.99 €

Kontakt

Ako nakupovať

Pomoc

Môj účet

▸ Prázdny :-(

Doprava zdarma pre objednávky nad 59,99 € s Packetou a SPS Boxmi.

Efficient Algorithms for Listing Combinatorial Structures

Name: Efficient Algorithms for Listing Combinatorial Structures
Brand: Cambridge University Press
SKU: 02022652
Price: 51.54 EUR
Availability: InStock
Author: Leslie Ann Goldberg
ISBN: 9780521117883

Leslie Ann Goldberg

Jazyk

Angličtina

Kniha Brožovaná

Libristo kód: 02022652

Nakladateľstvo Cambridge University Press, júl 2009

First published in 1993, this thesis is concerned with the design of efficient algorithms for listin... Celý popis

Libristo kód: 02022652

125 b

51.54 €

Skladom u dodávateľa Odosielame za 9-15 dní

30 dní na vrátenie tovaru

Zákazníci tiež kúpili

Critical Role: The Mighty Nein Origins: Yasha Ashley Johnson

Pevná

13.97 €

Auxiliares de servicios generales. Ministerio de defensa. Programa 1 (ayudantes de cocina) temario, Editorial Mad

binding.

35.03 €

Efficient Consumer Response - Komponenten, Kooperationsfelder und moegliche Probleme J.C. Scheffold

Brožovaná

16.20 €

Auf den Spuren des Inn-Chiemsee-Gletschers, Übersicht Robert Darga

Brožovaná

18.02 €

Lissabon. Lisboa. Lisbon

Mapa

9.81 €

Les Douleurs fantômes Mélissa Da Costa

Brožovaná

10.83 €

Die Erzählanalyse JAKOB Marc Luder

Brožovaná

13.56 €

Salons de T.Thore W. burger

Brožovaná

29.26 €

Schleswig-Holstein Peter Schuster

Pevná

12.75 €

Una industria que vive de la muerte Benito Perez Galdos

Adobe ePub DRM

5.97 €

Aufwachsen zwischen Traditions- und Zukunftsorientierung Matthias D. Witte

Brožovaná

53.16 €

Weltgesellschaft in Bewegung Christoph Virgl

Brožovaná

47.29 €

The Promised Neverland T02

Brožovaná

10.73 €

Indice Para La Sociedad Actual Hugo A E Fritzler

Brožovaná

24.20 €

Formation Certification MCSD Examen 70-483 (tome 1) Patrice Rey

Brožovaná

35.74 €

Unterstützung der Elternarbeit durch tiergestützte Intervention in der stationären Unterbringung Christian Haas

Brožovaná

16.20 €

Čo vietor spieva Alexander Blok

Pevná

6.17 €

Les investissements directs étrangers (IDE) et l'économie camerounaise Ivan Mélachéo

Brožovaná

44.55 €

Krankheiten peripherer Nerven Reinhard Kiefer

Brožovaná

50.43 €

Apercu Historique Sur Les Ferments Et Fermentations Normales Et Morbides Roussy-B

Brožovaná

28.86 €

Guardini, R., obras Selectas. Tomo II- El Padrenuestro - Los salmos - Oraciones para iniciar el día

Pevná

20.55 €

El cristal sanador : recetas a base de cristales que cambiarán tu vida Philip Permutt

Brožovaná

23.79 €

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.