Compartir
Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés)
Leslie Ann Goldberg
(Autor)
·
Cambridge University Press
· Tapa Dura
Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés) - Goldberg, Leslie Ann
$ 125.26
$ 140.00
Ahorras: $ 14.74
Elige la lista en la que quieres agregar tu producto o crea una nueva lista
✓ Producto agregado correctamente a la lista de deseos.
Ir a Mis ListasSe enviará desde nuestra bodega entre el
Lunes 10 de Junio y el
Martes 11 de Junio.
Lo recibirás en cualquier lugar de Estados Unidos entre 1 y 3 días hábiles luego del envío.
Reseña del libro "Efficient Algorithms for Listing Combinatorial Structures Hardback (Distinguished Dissertations in Computer Science) (en Inglés)"
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.
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
- 0% (0)
Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Dura.
✓ Producto agregado correctamente al carro, Ir a Pagar.
