Skip to content
Welcome To Our Store.
100,000+ Products for Home, Medical, Office & Classroom Needs
Search
Skip to product information
1 of 1

Algorithmic Problems in Groups and Semigroups - Hardcover

$178.18 USD
$178.18 USD
Sale Sold out
Shipping calculated at checkout.
In stock (100 units), ready to be shipped

Available Offers

Fast delivery available on most orders

Multiple secure payment options accepted

Secure checkout with
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Flight Range: Up to 1,000 meters (3,280 feet)

Maximum Speed: 45 kilometers per hour (28 miles per hour)

For all orders exceeding a value of 100USD shipping is offered for free.

Returns will be accepted for up to 10 days of Customer’s receipt or tracking number on unworn items. You, as a Customer, are obliged to inform us via email before you return the item.

Otherwise, standard shipping charges apply. Check out our delivery Terms & Conditions for more details.

View Product Details
Shopping cart
Product Product subtotal Quantity Price Product subtotal
Algorithmic Problems in Groups and Semigroups - Hardcover
Algorithmic Problems in Groups and Semigroups - Hardcover
Algorithmic Problems in Groups and Semigroups - Hardcover
$178.18/ea
$0.00
$178.18/ea $0.00

Product Description

by Jean-Camille Birget (Editor), Stuart Margolis (Editor), John Meakin (Editor)

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.

Number of Pages: 309
Dimensions: 0.82 x 9.57 x 6.46 IN
Illustrated: Yes
Publication Date: December 10, 1999
you might like