Book Description
Table of contents
Author : Ákos Seress
Publisher : Cambridge University Press
Page : 292 pages
File Size : 39,36 MB
Release : 2003-03-17
Category : Mathematics
ISBN : 9780521661034
Table of contents
Author : Gregory Butler
Publisher :
Page : 238 pages
File Size : 11,53 MB
Release : 1991
Category : Algorithms
ISBN : 9780387549552
Author : Derek F. Holt
Publisher : CRC Press
Page : 532 pages
File Size : 31,76 MB
Release : 2005-01-13
Category : Mathematics
ISBN : 1420035215
The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics. The Handbook of Computational Group Theory offers the first complete treatment of all the fundame
Author : Larry Finkelstein, William M. Kantor
Publisher : American Mathematical Soc.
Page : 404 pages
File Size : 13,71 MB
Release :
Category : Algebra
ISBN : 9780821885772
The workshop "Groups and Computations" took place at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers University in June 1995. This and an earlier workshop held in October 1991 was aimed at merging theory and practice within the broad area of computation with groups. The primary goal of the previous workshop was to foster a dialogue between researchers studying the computational complexity of group algorithms and those engaged in the development of practical software. It was expected that this would lead to a deeper understanding of the mathematical issues underlying group computation and that this understanding would lead, in turn, to faster algorithms. Comments and subsequent work indicated that this goal had been achieved beyond expectations. The second workshop was designed to reinforce the progress in these directions. The scientific program consisted of invited lectures and research announcements, as well as informal discussions and software demonstrations. The eight extended talks discussed randomization, permutation groups, matrix groups, software systems, fast Fourier transforms and their applications to signal processing and data analysis, computations with finitely presented groups, and implementation and complexity questions. As in the previous workshop, speakers ranged from established researchers to graduate students.
Author : Frank Dehne
Publisher : Springer
Page : 657 pages
File Size : 39,2 MB
Release : 2015-07-27
Category : Computers
ISBN : 3319218409
This book constitutes the refereed proceedings of the 14th Algorithms and Data Structures Symposium, WADS 2015, held in Victoria, BC, Canada, August 2015. The 54 revised full papers presented in this volume were carefully reviewed and selected from 148 submissions. The Algorithms and Data Structures Symposium - WADS (formerly Workshop on Algorithms And Data Structures), which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. WADS includes papers presenting original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
Author : Laureano Gonzalez-Vega
Publisher : Birkhäuser
Page : 407 pages
File Size : 45,72 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 3034891040
The present volume contains a selection of refereed papers from the MEGA-94 symposium held in Santander, Spain, in April 1994. They cover recent developments in the theory and practice of computation in algebraic geometry and present new applications in science and engineering, particularly computer vision and theory of robotics. The volume will be of interest to researchers working in the areas of computer algebra and symbolic computation as well as to mathematicians and computer scientists interested in gaining access to these topics.
Author : Lowell W. Beineke
Publisher : Cambridge University Press
Page : 302 pages
File Size : 10,23 MB
Release : 2004-10-04
Category : Mathematics
ISBN : 9780521801973
There is no other book with such a wide scope of both areas of algebraic graph theory.
Author : Arjeh M. Cohen
Publisher : Springer Science & Business Media
Page : 374 pages
File Size : 25,45 MB
Release : 1998-12-15
Category : Computers
ISBN : 9783540634805
This book presents the basic concepts and algorithms of computer algebra using practical examples that illustrate their actual use in symbolic computation. A wide range of topics are presented, including: Groebner bases, real algebraic geometry, lie algebras, factorization of polynomials, integer programming, permutation groups, differential equations, coding theory, automatic theorem proving, and polyhedral geometry. This book is a must read for anyone working in the area of computer algebra, symbolic computation, and computer science.
Author : William M. Kantor
Publisher : Walter de Gruyter
Page : 376 pages
File Size : 45,33 MB
Release : 2014-01-02
Category : Mathematics
ISBN : 3110872749
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.
Author : Donald L. Kreher
Publisher : CRC Press
Page : 344 pages
File Size : 46,74 MB
Release : 2020-09-23
Category : Mathematics
ISBN : 1000102874
This textbook thoroughly outlines combinatorial algorithms for generation, enumeration, and search. Topics include backtracking and heuristic search methods applied to various combinatorial structures, such as: Combinations Permutations Graphs Designs Many classical areas are covered as well as new research topics not included in most existing texts, such as: Group algorithms Graph isomorphism Hill-climbing Heuristic search algorithms This work serves as an exceptional textbook for a modern course in combinatorial algorithms, providing a unified and focused collection of recent topics of interest in the area. The authors, synthesizing material that can only be found scattered through many different sources, introduce the most important combinatorial algorithmic techniques - thus creating an accessible, comprehensive text that students of mathematics, electrical engineering, and computer science can understand without needing a prior course on combinatorics.