Udvidet returret til d. 31. januar 2025

Efficient Algorithms for Listing Combinatorial Structures - Leslie Ann (Sandia National Laboratories Goldberg - Bog

Bag 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.

Vis mere
  • Sprog:
  • Engelsk
  • ISBN:
  • 9780521450218
  • Indbinding:
  • Hardback
  • Sideantal:
  • 178
  • Udgivet:
  • 22. april 1993
  • Størrelse:
  • 170x244x11 mm.
  • Vægt:
  • 49 g.
  • 8-11 hverdage.
  • 29. november 2024
På lager

Normalpris

  • BLACK NOVEMBER

Medlemspris

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af 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.

Brugerbedømmelser af Efficient Algorithms for Listing Combinatorial Structures



Find lignende bøger
Bogen Efficient Algorithms for Listing Combinatorial Structures findes i følgende kategorier:

Gør som tusindvis af andre bogelskere

Tilmeld dig nyhedsbrevet og få gode tilbud og inspiration til din næste læsning.