Livrare gratuită pentru comenzile peste 349,00 lei.

Verifică starea comenzii

Faceți parte dintr-o comunitate de iubitori de cărți din întreaga lume și beneficiați de o mulțime de avantaje Creați-vă un cont gratuit

Transport gratuit la punctele de livrare Pick Up peste 349.00 lei

Packeta 15.00 lei Cargus 28.00 lei Easybox 20.00 lei FAN 20.00 lei Punct FAN 16.00 lei Punct DPD 17.00 lei Curier Sameday 24.00 lei Curier DPD 25.00 lei

Contact

Cum să cumpăr

Ajutor

Contul meu

▸ Gol :-(

Livrare gratuită pentru comenzile peste 349,00 lei.

Algorithmic Problems in Groups and Semigroups

Name: Algorithmic Problems in Groups and Semigroups
Brand: Springer, Basel
SKU: 01399262
Price: 571.12 RON
Availability: InStock
Author: Jean-Camille Birget
ISBN: 9780817641306

Limba

engleză

Carte Copertă tare

Codul Libristo: 01399262

Editura Springer, Basel, noiembrie 1999

This volume contains papers which are based primarily on talks given at an inter national conference... Descrierea completă

Codul Libristo: 01399262

263 b

571.12 lei

În depozitul extern Expediem în 10-13 zile

30 de zile pentru retur bunuri

Clienții au cumpărat de asemenea

Olivovník Lucinda Rileyová

Copertă tare

102.61 lei

Patriarkh (Ex Batushka): Prorok Ilja Patriarkh (Ex Batushka)

Audio CD

121.29 lei

Hravé diktáty 5 Emília Suríková Miroslava

Carte broșată

39.14 lei

Die Abenteuer des Sherlock Holmes Arthur Conan Doyle

Carte broșată

63.25 lei

Das Neue Dorf Clemens Renker

Carte broșată

262.12 lei

Alles, 23 Audio-CDs + 1 Buch Herbert Grönemeyer

Audio CD

1 028.45 lei

Â«Und es ward LichtÂ» - zur Kulturgeschichte des Lichts Maja Svilar

Carte broșată

475.18 lei

Las cartas secretas del monje que vendió su Ferrari Robin S. Sharma

Carte broșată

68.26 lei

Bedeutung des Humors in der klassischen Werbung. Ein internationaler Vergleich Jean Maurice Port

Carte broșată

95.19 lei

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.