Marknadens största urval
Fri frakt över 199 kr
Snabb leverans
Hjälp
Logga in
  1. Hem
  2. Böcker
  3. Företagande & lärande
  4. Data & IT
  5. Efficient Algorithms for Listing Combinatorial Structures

Efficient Algorithms for Listing Combinatorial Structures

av Leslie Ann (Sandia National Laboratories Goldberg

del av Distinguished Dissertations in Computer Science-serien

Efficient Algorithms for Listing Combinatorial Structures av Leslie Ann (Sandia National Laboratories Goldberg
Om Efficient Algorithms for Listing Combinatorial Structures

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.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9780521450218
  • Format:
  • Inbunden
  • Sidor:
  • 178
  • Utgiven:
  • 22. april 1993
  • Mått:
  • 170x244x11 mm.
  • Vikt:
  • 49 g.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 9. december 2024

Om Leslie Ann (Sandia National Laboratories Goldberg

Se alla böcker av Leslie Ann (Sandia National Laboratories Goldberg

Beskrivning av Efficient Algorithms for Listing Combinatorial Structures

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.

Användarnas betyg av Efficient Algorithms for Listing Combinatorial Structures



Andra köpte även...
Hitta liknande böcker
Boken Efficient Algorithms for Listing Combinatorial Structures finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.