Efficient Algorithms for Listing Combinatorial Structures
af Leslie Ann (Sandia National Laboratories Goldberg
Bog, Paperback, Engelsk, 2009
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.
Priser fra 4 boghandlere
- BoghandlerPrisFragtLevering
- SAXO299,95 kr.39,95 kr.UkendtKøb for 299,95 kr.Køb
- Bogreolen449,95 kr.34,95 kr.2-4 ugerKøb for 449,95 kr.Køb
- Tales450,95 kr.34,95 kr.2-4 ugerKøb for 450,95 kr.Køb
- Pling BØGER450,95 kr.34,95 kr.2-4 ugerKøb for 450,95 kr.Køb
Bogdetaljer
- SprogEngelsk
- IndbindingPaperback
- ISBN9780521117883
- Udgivet30/07/2009
- Udgivet afCambridge University Press
- Længde180 sider
- ForfatterLeslie Ann (Sandia National Laboratories Goldberg
- GenreBusiness og læring, Computer og IT