Kontakt
Ako nakupovať
Doručenie
Nákupný poradca
Efficient Algorithms for Listing Combinatorial Structures
Angličtina
340 b
Až 30 dní na vrátenie tovaru
Zákazníci tiež kúpili
/
Pevná
225.38
€
/
Brožovaná
66.07
€
/
Brožovaná
15.90
€
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.
Informácie o knihe
Angličtina
Darujte túto knihu ešte dnes
Je to jednoduché
1 Pridajte knihu do košíka a vyberte možnosť doručiť ako darček 2 Obratom Vám zašleme poukaz 3 Knihu zašleme na adresu obdarovanéhoMohlo by vás tiež zaujímať
/
Brožovaná
20.26
€
/
Brožovaná
35.76
€
/
Brožovaná
10.83
€
/
Pevná
103.16
€
/
Brožovaná
175.32
€
/
Brožovaná
22.89
€
/
Brožovaná
51.78
€
Ahoj! Som Libroamiko, tvoj knižný radca.
Ako ti môžem pomôcť?