1991, ISBN: 3540549552

[EAN: 9783540549550], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; KOMBINATORIK; MATHEMATIK; ALGEBRAICALGEBRAISCHEALGORITHMEN; COMPUTATIONALCOMPLEXITY; COMPUTATIONAL… Mehr…

[EAN: 9783540549550], Neubuch, [SC: 0.0], [PU: Springer Berlin Heidelberg], ALGORITHMUS; KOMBINATORIK; MATHEMATIK; ALGEBRAICALGEBRAISCHEALGORITHMEN; COMPUTATIONALCOMPLEXITY; COMPUTATIONALGROUPTHEORY; GRAPH; GRAPHGRAPH-ALGORITHMEN; GROUPTHEORY; KOMPLEXITÄTUNDALGORITHMEN; PERMUTATIOENUNDKOMBINATIONEN; PERMUTATIONSANDCOMBINATIONS; ALGORITHMS; DATASTRUCTURES; ALGORITHMANALYSISANDPROBLEMCOMPLEXITY; COMBINATORICS, Druck auf Anfrage Neuware - This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of the fundamental algorithms for permutation groups with reference to aspects of combinatorial group theory, soluble groups, and p-groups where appropriate. The book begins with a constructive introduction to group theory and algorithms for computing with small groups, followed by a gradual discussion of the basic ideas of Sims for computing with very large permutation groups, and concludes with algorithms that use group homomorphisms, as in the computation of Sylowsubgroups. No background in group theory is assumed. The emphasis is on the details of the data structures and implementation which makes the algorithms effective when applied to realistic problems. The algorithms are developed hand-in-hand with the theoretical and practical justification.All algorithms are clearly described, examples are given, exercises reinforce understanding, and detailed bibliographical remarks explain the history and context of the work. Much of the later material on homomorphisms, Sylow subgroups, and soluble permutation groups is new. 256 pp. Englisch, Books<

1991, ISBN: 3540549552

[EAN: 9783540549550], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS; KOMBINATORIK; MATHEMATIK; ALGEBRAICALGEBRAISCHEALGORITHMEN; COMPUTATIONALCOMPLEXITY; COMPUTATIONALGROUPTHEORY… Mehr…

[EAN: 9783540549550], Neubuch, [PU: Springer Berlin Heidelberg], ALGORITHMUS; KOMBINATORIK; MATHEMATIK; ALGEBRAICALGEBRAISCHEALGORITHMEN; COMPUTATIONALCOMPLEXITY; COMPUTATIONALGROUPTHEORY; GRAPH; GRAPHGROUPTHEORY; KOMPLEXITÄTUNDALGORITHMEN; PERMUTATIOENUNDKOMBINATIONEN; PERMUTATIONSANDCOMBINATIONS; ALGORITHMS; DATASTRUCTURES; ALGORITHMANALYSISANDPROBLEMCOMPLEXITY; COMBINATORICS; GRAPH-ALGORITHMEN, Druck auf Anfrage Neuware -This is the first-ever book on computational group theory.It provides extensive and up-to-date coverage of thefundamental algorithms for permutation groups with referenceto aspects of combinatorial group theory, soluble groups,and p-groups where appropriate.The book begins with a constructive introduction to grouptheory and algorithms for computing with small groups,followed by a gradual discussion of the basic ideas of Simsfor computing with very large permutation groups, andconcludes with algorithms that use group homomorphisms, asin the computation of Sylowsubgroups. No background ingroup theory is assumed.The emphasis is on the details of the data structures andimplementation which makes the algorithms effective whenapplied to realistic problems. The algorithms are developedhand-in-hand with the theoretical and practicaljustification.All algorithms are clearly described,examples are given, exercises reinforce understanding, anddetailed bibliographical remarks explain the history andcontext of the work.Much of the later material on homomorphisms, Sylowsubgroups, and soluble permutation groups is new. 256 pp. Englisch, Books<

1991, ISBN: 3540549552

1991 Kartoniert / Broschiert Algorithmus, Kombinatorik, Mathematik, Diskrete Mathematik, Gruppen und Gruppentheorie, Algorithmen und Datenstrukturen, Theoretische Informatik, Algebraic … Mehr…

1991 Kartoniert / Broschiert Algorithmus, Kombinatorik, Mathematik, Diskrete Mathematik, Gruppen und Gruppentheorie, Algorithmen und Datenstrukturen, Theoretische Informatik, Algebraic Algebraische Algorithmen; computational complexity; Computational Group Theory; Graph; graph Graph-Algorithmen; Group Theory; Komplexität und Algorithmen; Permutatioen und Kombinationen; Permutations and Combinations; algorithms; data structures; Algorithm analysis and problem complexity; combinatorics, mit Schutzumschlag 11, [PU:Springer Berlin Heidelberg; Springer Berlin]<

1991, ISBN: 3540549552

1991 Kartoniert / Broschiert Algorithmus, Kombinatorik, Mathematik, Diskrete Mathematik, Gruppen und Gruppentheorie, Algorithmen und Datenstrukturen, Theoretische Informatik, algebraicA… Mehr…

1991 Kartoniert / Broschiert Algorithmus, Kombinatorik, Mathematik, Diskrete Mathematik, Gruppen und Gruppentheorie, Algorithmen und Datenstrukturen, Theoretische Informatik, algebraicAlgebraischeAlgorithmen; ComputationalComplexity; ComputationalGroupTheory; Graph; graphGraph-Algorithmen; Grouptheory; KomplexitätundAlgorithmen; PermutatioenundKombinationen; Permutationsandcombinations; algorithms; datastructures; algorithmanalysisandproblemcomplexity; combinatorics, mit Schutzumschlag 11, [PU:Springer Berlin Heidelberg; Springer Berlin]<

2008, ISBN: 9783540549550

Springer, Taschenbuch, Auflage: 1991, 256 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 1, 1.76 kg, Verkaufsrang: 5912, Informatik, IT-Ausbildung & -Beruf… Mehr…

Springer, Taschenbuch, Auflage: 1991, 256 Seiten, Publiziert: 2008-06-13T00:00:01Z, Produktgruppe: Buch, Hersteller-Nr.: 1, 1.76 kg, Verkaufsrang: 5912, Informatik, IT-Ausbildung & -Berufe, Computer & Internet, Kategorien, Bücher, Algorithmen, Programmierung & Webdesign, Algebra & Zahlentheorie, Naturwissenschaft & Mathematik, Fachbücher, Naturwissenschaften & Technik, Format: Illustriert, Springer, 2008<