Nemokamas pristatymas nuo 29€

  • check 10 + milijonai knygų
  • check Naujienos (kiekvieną dieną)
  • check 1 + mln. klientų mus pasitiki
  • check Geros kainos % Nuolaidos
  • check Nemokamas pristatymas nuo 29 eur

Efficient Algorithms for Listing Combinatorial Structures - Leslie Ann Goldberg

Anglų
2012-01-05
208,01 € 277,35 €

-25% su kodu BOOKS

Minkšti viršeliai Kieti viršeliai 277,35 €
Turime sandėlyje pas mūsų tiekėją

Pristatymas per 17-23 d.d.

30 dienų grąžinimo politika

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 that are of interes ... Visas aprašymas

Jums taip pat gali patikti

Aprašymas

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 that are of interest to theoretical computer scientists and combinatorialists? Among those families considered are unlabeled graphs, first-order one properties, Hamiltonian graphs, graphs with cliques of specified order, and k-colorable graphs. Some related work is also included that 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.

Daugiau informacijos

Autorius Leslie Ann Goldberg
Leidėjas Cambridge University Press
Išleidimo metai 2012
Viršelio tipas Kieti viršeliai
EAN 9780521450218
Parašykite savo atsiliepimą
Jūs peržiūrėjote: Efficient Algorithms for Listing Combinatorial Structures
Jūsų įvertinimas:

Goodreads Atsiliepimai

208,01 € 277,35 €