Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Preverjanje stanja naročila

Postanite del skupnosti ljubiteljev knjig z vsega sveta in uživajte v številnih ugodnostih. Ustvarite brezplačen račun

Brezplačna dostava Zásilkovna nad 69.99 €

Zbirna točka GLS 4.49 € Zbirna točka DPD 2.99 € Kurirska služba GLS 5.49 € Kurir DPD 3.49 € Kurirska služba Express One 3.49 € Zbirno mesto Express One 3.49 € Zbirno mesto Pošte Slovenije 3.49 € Dostava preko Pošte Slovenije 3.49 €

Kontakt

Kako nakupovati

Pomoč

Moj račun

▸ Prazna :-(

Brezplačna dostava za naročila nad 69,99 € na prevzemna mesta DPD in Express One.

Efficient Algorithms for Listing Combinatorial Structures

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

Leslie Ann Goldberg

Jezik

Angleščina

Knjiga Trda

Koda Libristo: 02031294

Založba Cambridge University Press, april 1993

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

Koda Libristo: 02031294

340 b

139.99 €

Na zalogi pri dobavitelju Odposlali bomo v 14-21 dneh

Do 30 dni za vračilo

Drugi so kupili tudi

Verschwender Ferdinand Raimund

Mehka

10.98 €

Gulag a Československo Válka Adam Hradilek

Trda

21.17 €

FACULTATIVO ESPECIALISTA MEDICO/A OSAKIDETZA-SERVICIO VAS 7 EDITORES

Mehka

19.76 €

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

Mehka

3.12 €

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

Mehka

15.42 €

Staudingers Kommentar BGB §§ 1638-1683 (Vermögenssorge, Kindesschutz, Sorgerechtswechsel) Michael Coester

Trda

202.53 €

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

Mehka

61.92 €

HISTORIA DEL CINE JOSE LUIS SANCHEZ NORIEGA

Trda

35.70 €

EL MALEFICIO DE LA PRINCESA ANTONIO A. GOMEZ YEBRA

Mehka

14.82 €

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

Mehka

15.22 €

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

Mehka

14.41 €

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

Mehka

15.83 €

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.