Efficient Algorithms for Listing Combinatorial Structures (Bog, Paperback / softback, Engelsk)
  1. Forside
  2. Bøger
  3. Engelske bøger
  4. Kombinatorik og grafteori
  5. Algoritmer og datastrukturer
  6. Efficient Algorithms for Listing Combinatorial Structures

Efficient Algorithms for Listing Combinatorial Structures

(Bog, Paperback / softback, Engelsk)
Forfatter: Leslie Ann (Sandia National Laboratories Goldberg
Efficient Algorithms for Listing Combinatorial Structures
Forlag: Cambridge University Press

Bemærk: Kan ikke leveres før jul.

Når du handler på WilliamDam.dk, betaler du den pris du ser.

  • Ingen gebyrer
  • Ingen abonnementer
  • Ingen bindingsperioder

Relaterede kategorier

Algoritmer og datastrukturer Kombinatorik og grafteori
  = Emner / kategorier
  = Sektioner / guides
  = Specialsider
  = Kampagner

Beskrivelse

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.

Læsernes anmeldelser (0)

Alle detaljer

Forlag Cambridge University Press
Forfatter Leslie Ann (Sandia National Laboratories Goldberg
Type Bog
Format Paperback / softback
Sprog Engelsk
Udgivelsesdato 30-07-2009
Første udgivelsesår 2009
Serie Distinguished Dissertations in Computer Science
Illustrationer Worked examples or Exercises
Originalsprog United Kingdom
Sideantal 180
Indbinding Paperback / softback
Forlag Cambridge University Press
Sideoplysninger 180 pages, Worked examples or Exercises
Mål 244 x 170 x 10
ISBN-13 / EAN-13 9780521117883