Seress akos (42 risultati)

Hardcover. Condizione: Wie neu. Condizione sovraccoperta: Ohne Schutzumschlag. 1. Auflage. VIII, 278 pages.

Paperback. Condizione: Brand New. 196 pages. 9.00x6.00x0.45 inches. In Stock.

Hardcover. Condizione: Wie neu. Condizione sovraccoperta: Ohne Schutzumschlag. 1. Auflage. (Ohio State University Mathematical Research Institute Publications, 10); IX, 322 pages.

Condizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardcover. Condizione: Gut. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 20 SER 9780521661034 Sprache: Englisch Gewicht in Gramm: 550.…

Condizione: New.

Condizione: New.

Condizione: New.

Hardback. Condizione: New. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.…

Condizione: New.

Condizione: New.

Condizione: New.

Condizione: New. Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. Series: Cambridge Tracts in Mathematics. Num Pages: 274 pages, 30 b/w illus. BIC Classification: PBG. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 19. Weight in Grams: 529. . 2003. Illustrated. hardcover. . . . . Books ship from the US and Ireland.…

Condizione: new.

Hardcover. Octavo, viii, 368 pages. In Very Good condition. Spine is grey with red lettering. Light bumping and staining to foot edge of boards. Faint bumping around edges of boards and light stain to front board. Light foxing to head edge of exterior text block. Ownership signature on front free end paper. NOTE: Shelved in ND-HV. 1378440. FP New Rockville Stock.…

Hardcover. Condizione: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New. pp. viii + 322 Illus.

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains contributions by the participants of the conference 'Groups and Computation', which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on 'Groups and Computation' held at DIMACS in 1991 and 1995. There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field. The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.…

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th conference of this series was held. Usually, there are twenty to thirty invited 20-minute talks in each of the three main areas. However, at the 2000 meeting, the combinatorics part of the conference was extended, to honor the 65th birthday of Professor Dijen Ray-Chaudhuri. This volulme is the proceedings of this extension. Most of the papers are in coding theory and design theory, reflecting the major interest of Professor Ray-Chaudhuri, but there are articles on association schemes, algebraic graph theory, combinatorial geometry, and network flows as well. There are four surveys and seventeen research articles, and all of these went through a thorough refereeing process. The volume is primarily recommended for researchers and graduate students interested in new developments in coding theory and design theory.…

Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.…

Condizione: New. pp. viii + 322.

Hardcover. Condizione: Brand New. illustrated edition. 322 pages. 9.25x6.75x0.75 inches. In Stock.

Hardback. Condizione: New. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.…

Hardback. Condizione: New. Reprint 2012. Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th conference of this series was held. Usually, there are twenty to thirty invited 20-minute talks in each of the three main areas. However, at the 2000 meeting, the combinatorics part of the conference was extended, to honor the 65th birthday of Professor Dijen Ray-Chaudhuri. This volulme is the proceedings of this extension. Most of the papers are in coding theory and design theory, reflecting the major interest of Professor Ray-Chaudhuri, but there are articles on association schemes, algebraic graph theory, combinatorial geometry, and network flows as well. There are four surveys and seventeen research articles, and all of these went through a thorough refereeing process. The volume is primarily recommended for researchers and graduate students interested in new developments in coding theory and design theory.…

Condizione: New. 2002. Hardcover. . . . . .

Condizione: New. In English.

Hardback. Condizione: New. Reprint 2012. Following an initiative of the late Hans Zassenhaus in 1965, the Departments of Mathematics at The Ohio State University and Denison University organize conferences in combinatorics, group theory, and ring theory. Between May 18-21, 2000, the 25th conference of this series was held. Usually, there are twenty to thirty invited 20-minute talks in each of the three main areas. However, at the 2000 meeting, the combinatorics part of the conference was extended, to honor the 65th birthday of Professor Dijen Ray-Chaudhuri. This volulme is the proceedings of this extension. Most of the papers are in coding theory and design theory, reflecting the major interest of Professor Ray-Chaudhuri, but there are articles on association schemes, algebraic graph theory, combinatorial geometry, and network flows as well. There are four surveys and seventeen research articles, and all of these went through a thorough refereeing process. The volume is primarily recommended for researchers and graduate students interested in new developments in coding theory and design theory.…

Condizione: As New. Unread book in perfect condition.