Algorithmic Problems in Groups and Semigroups (Trends in Mathematics)
14 Angebote vergleichen

Lieferung aus: Deutschland, zzgl. Versandkosten, in stock.
Algorithmic Problems in Groups and Semigroups. This volume contains papers which are based primarily on talks given at an inter national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups.

Lieferung aus: Deutschland, 2-3 Werktage.
This volume contains papers which are based primarily on talks given at an inter­ national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun­ dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math­ ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac­ tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups. von Birget, Jean-Camille und Margolis, Stuart und Meakin, John und Sapir, Mark, Neu.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, betterworldbooks_.
This volume contains papers which are based primarily on talks given at an inter- national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun- dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math- ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac- tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups. Hardcover, Ausgabe: 2000, Label: Birkhäuser, Birkhäuser, Produktgruppe: Book, Publiziert: 1999-11-01, Studio: Birkhäuser, Verkaufsrang: 5645750.

Lieferung aus: Vereinigte Staaten von Amerika, Usually ships in 1-2 business days.
Von Händler/Antiquariat, betterworldbooks_.
This volume contains papers which are based primarily on talks given at an inter­ national conference on Algorithmic Problems in Groups and Semigroups held at the University of Nebraska-Lincoln from May ll-May 16, 1998. The conference coincided with the Centennial Celebration of the Department of Mathematics and Statistics at the University of Nebraska-Lincoln on the occasion of the one hun­ dredth anniversary of the granting of the first Ph.D. by the department. Funding was provided by the US National Science Foundation, the Department of Math­ ematics and Statistics, and the College of Arts and Sciences at the University of Nebraska-Lincoln, through the College's focus program in Discrete, Experimental and Applied Mathematics. The purpose of the conference was to bring together researchers with interests in algorithmic problems in group theory, semigroup theory and computer science. A particularly useful feature of this conference was that it provided a framework for exchange of ideas between the research communities in semigroup theory and group theory, and several of the papers collected here reflect this interac­ tion of ideas. The papers collected in this volume represent a cross section of some of the results and ideas that were discussed in the conference. They reflect a synthesis of overlapping ideas and techniques stimulated by problems concerning finite monoids, finitely presented mono ids, finitely presented groups and free groups. Hardcover, Ausgabe: 2000, Label: Birkhäuser, Birkhäuser, Produktgruppe: Book, Publiziert: 1999-12-10, Studio: Birkhäuser, Verkaufsrang: 7713554.

Lieferung aus: Kanada, In Stock, plus shipping.
Books, Science and Nature, Algorithmic Problems in Groups and Semigroups, Algorithmic problems are at the heart of many aspects of algebra, logic, and theoretical computer science, and of interest to a broad audience. The expository articles in this collection, written by experts in their respective fields, present new results, interesting techniques, and often overlapping ideas from diverse fields. This book will serve as a good introduction to algorithmic problems in groups and semigroups.

Lieferung aus: Deutschland, Versandkostenfrei.
Von Händler/Antiquariat, Bookshub [56517106], Karol Bagh, KB, India.
US edition. Perfect condition. Ship by express service to USA, Canada, Australia, France, Italy, UK, Germany and Netherland. Customer satisfaction our priority. Please email before placeing order if you have any doubt in mind regarding book.

Von Händler/Antiquariat, Travel-Bookshop [3181647], Hertfordshire, United Kingdom.
Brand new books and maps available immediately from a reputable and well rated UK bookseller - not sent from the USA; despatched promptly and reliably worldwide by Royal Mail;

Von Händler/Antiquariat, Image book store [60244926], Antioch, CA, U.S.A.
0817641300 Brand New. Please allow 4-14 Business days to arrive.

Lieferung aus: Vereinigte Staaten von Amerika, In Stock.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen