Efficient algorithms for listing combinatorial structures
Auteur :
Goldberg, Leslie Ann
Éditeur :
Cambridge University Press
ISBN :
9780521117883
Date de publication :
30 juil. 2009
Dimensions :
24,4 x 17,0 x 1,0 cm
Poids :
300 g
Format :
Trade paperback (US)
Langue :
Anglais
Pays d'origine :
Grande Bretagne
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. 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.