Norges billigste bøker

Efficient Algorithms for Listing Combinatorial Structures

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 mer
  • Språk:
  • Engelsk
  • ISBN:
  • 9780521117883
  • Bindende:
  • Paperback
  • Sider:
  • 180
  • Utgitt:
  • 30 juli 2009
  • Dimensjoner:
  • 170x244x10 mm.
  • Vekt:
  • 300 g.
  Gratis frakt
Leveringstid: 2-4 uker
Forventet levering: 17 juli 2024

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

Brukervurderinger av Efficient Algorithms for Listing Combinatorial Structures



Finn lignende bøker
Boken Efficient Algorithms for Listing Combinatorial Structures finnes i følgende kategorier:

Gjør som tusenvis av andre bokelskere

Abonner på vårt nyhetsbrev og få rabatter og inspirasjon til din neste leseopplevelse.