Donald L. Kreher, Douglas R. Stinson
Combinatorial Algorithms (eBook, PDF)
Generation, Enumeration, and Search
66,95 €
66,95 €
inkl. MwSt.
Sofort per Download lieferbar
33 °P sammeln
66,95 €
Als Download kaufen
66,95 €
inkl. MwSt.
Sofort per Download lieferbar
33 °P sammeln
Jetzt verschenken
Alle Infos zum eBook verschenken
66,95 €
inkl. MwSt.
Sofort per Download lieferbar
Alle Infos zum eBook verschenken
33 °P sammeln
Donald L. Kreher, Douglas R. Stinson
Combinatorial Algorithms (eBook, PDF)
Generation, Enumeration, and Search
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.

Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.
- Geräte: PC
- mit Kopierschutz
- eBook Hilfe
Andere Kunden interessierten sich auch für
- Handbook of Discrete and Combinatorial Mathematics (eBook, PDF)251,95 €
- Karin R SaoubGraph Theory (eBook, PDF)50,95 €
- Miklos BonaCombinatorics of Permutations (eBook, PDF)59,95 €
- Marcus SchaeferCrossing Numbers of Graphs (eBook, PDF)46,95 €
- Gary L. MullenHandbook of Finite Fields (eBook, PDF)137,95 €
- Constraints, Language and Computation (eBook, PDF)67,95 €
- Douglas Robert StinsonCryptography (eBook, PDF)48,95 €
-
-
-
Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Produktdetails
- Produktdetails
- Verlag: Taylor & Francis eBooks
- Seitenzahl: 344
- Erscheinungstermin: 23. September 2020
- Englisch
- ISBN-13: 9781000102871
- Artikelnr.: 60149558
- Verlag: Taylor & Francis eBooks
- Seitenzahl: 344
- Erscheinungstermin: 23. September 2020
- Englisch
- ISBN-13: 9781000102871
- Artikelnr.: 60149558
- Herstellerkennzeichnung Die Herstellerinformationen sind derzeit nicht verfügbar.
Kreher, Donald L.; Stinson, Douglas R.
Structures and Algorithms What are Combinatorial Algorithms? What are
Combinatorial Structures? What are Combinatorial Problems? O-Notation
Analysis of Algorithms Complexity Classes Data Structures Algorithm Design
Techniques Generating Elementary Combinatorial Objects Combinatorial
Generation Subsets k-Element Subsets Permutations More Topics in
Combinatorial Generation Integer Partitions Set Partitions, Bell and
Stirling Numbers Labeled Trees Catalan Families Backtracking Algorithms
Introduction A General Backtrack Algorithm Generating All Cliques
Estimating the Size of a Backtrack Tree Exact Cover Bounding Functions
Branch-and-Bound Heuristic Search Introduction to Heuristic Algorithms
Design Strategies for Heuristic Algorithms A Steepest-Ascent Algorithm for
Uniform Graph Partition A Hill-Climbing Algorithm for Steiner Triple
Systems Two Heuristic Algorithms for the Knapsack Problem A Genetic
Algorithm for the Traveling Salesman Problem Groups and Symmetry Groups
Permutation Groups Orbits of Subsets Coset Representatives Orbits of
k-tuples Generating Objects Having Automorphisms Computing Isomorphism
Introduction Invariants Computing Certificates Isomorphism of Other
Structures Basis Reduction Introduction Theoretical Development A Reduced
Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman
Knapsack System Bibliography Algorithm Index Problem Index Index
Combinatorial Structures? What are Combinatorial Problems? O-Notation
Analysis of Algorithms Complexity Classes Data Structures Algorithm Design
Techniques Generating Elementary Combinatorial Objects Combinatorial
Generation Subsets k-Element Subsets Permutations More Topics in
Combinatorial Generation Integer Partitions Set Partitions, Bell and
Stirling Numbers Labeled Trees Catalan Families Backtracking Algorithms
Introduction A General Backtrack Algorithm Generating All Cliques
Estimating the Size of a Backtrack Tree Exact Cover Bounding Functions
Branch-and-Bound Heuristic Search Introduction to Heuristic Algorithms
Design Strategies for Heuristic Algorithms A Steepest-Ascent Algorithm for
Uniform Graph Partition A Hill-Climbing Algorithm for Steiner Triple
Systems Two Heuristic Algorithms for the Knapsack Problem A Genetic
Algorithm for the Traveling Salesman Problem Groups and Symmetry Groups
Permutation Groups Orbits of Subsets Coset Representatives Orbits of
k-tuples Generating Objects Having Automorphisms Computing Isomorphism
Introduction Invariants Computing Certificates Isomorphism of Other
Structures Basis Reduction Introduction Theoretical Development A Reduced
Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman
Knapsack System Bibliography Algorithm Index Problem Index Index
Structures and Algorithms What are Combinatorial Algorithms? What are
Combinatorial Structures? What are Combinatorial Problems? O-Notation
Analysis of Algorithms Complexity Classes Data Structures Algorithm Design
Techniques Generating Elementary Combinatorial Objects Combinatorial
Generation Subsets k-Element Subsets Permutations More Topics in
Combinatorial Generation Integer Partitions Set Partitions, Bell and
Stirling Numbers Labeled Trees Catalan Families Backtracking Algorithms
Introduction A General Backtrack Algorithm Generating All Cliques
Estimating the Size of a Backtrack Tree Exact Cover Bounding Functions
Branch-and-Bound Heuristic Search Introduction to Heuristic Algorithms
Design Strategies for Heuristic Algorithms A Steepest-Ascent Algorithm for
Uniform Graph Partition A Hill-Climbing Algorithm for Steiner Triple
Systems Two Heuristic Algorithms for the Knapsack Problem A Genetic
Algorithm for the Traveling Salesman Problem Groups and Symmetry Groups
Permutation Groups Orbits of Subsets Coset Representatives Orbits of
k-tuples Generating Objects Having Automorphisms Computing Isomorphism
Introduction Invariants Computing Certificates Isomorphism of Other
Structures Basis Reduction Introduction Theoretical Development A Reduced
Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman
Knapsack System Bibliography Algorithm Index Problem Index Index
Combinatorial Structures? What are Combinatorial Problems? O-Notation
Analysis of Algorithms Complexity Classes Data Structures Algorithm Design
Techniques Generating Elementary Combinatorial Objects Combinatorial
Generation Subsets k-Element Subsets Permutations More Topics in
Combinatorial Generation Integer Partitions Set Partitions, Bell and
Stirling Numbers Labeled Trees Catalan Families Backtracking Algorithms
Introduction A General Backtrack Algorithm Generating All Cliques
Estimating the Size of a Backtrack Tree Exact Cover Bounding Functions
Branch-and-Bound Heuristic Search Introduction to Heuristic Algorithms
Design Strategies for Heuristic Algorithms A Steepest-Ascent Algorithm for
Uniform Graph Partition A Hill-Climbing Algorithm for Steiner Triple
Systems Two Heuristic Algorithms for the Knapsack Problem A Genetic
Algorithm for the Traveling Salesman Problem Groups and Symmetry Groups
Permutation Groups Orbits of Subsets Coset Representatives Orbits of
k-tuples Generating Objects Having Automorphisms Computing Isomorphism
Introduction Invariants Computing Certificates Isomorphism of Other
Structures Basis Reduction Introduction Theoretical Development A Reduced
Basis Algorithm Solving Systems of Integer Equations The Merkle-Hellman
Knapsack System Bibliography Algorithm Index Problem Index Index