Isbn: 9780821801314 - computational complexity theory (038) (8 risultati)

- Rilegato
Da: Gwyn Tudur Davies, Aberystwyth, Regno UnitoGwyn Tudur Davies
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Molto buono
EUR 15,03
EUR 18,84 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Hardcover. Condizione: Very Good. Hbk, ix,128 p. Some light foxing mostly to end-papers and edges o/w a clean copy in very good condition. Contents : Overview of computational complexity theory / Juris Hartmanis -- The isomorphism conjecture and sparse sets / Stephen R. Mahaney -- Descriptive and computational complexity / Neil Immerman -- Complexity issues in crytography / Alan L. Selman -- Interactive proof systems / Shafi Goldwasser. [Congresses - American Mathematical Society Short Course, Computational Complexity Theory (1988 : Atlanta, Ga.] w104 / m166011.…

- Rilegato
Da: Better World Books, Mishawaka, IN, U.S.A.Better World Books
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 46,68
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
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.

- Rilegato
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 115,99
EUR 9,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: 1 disponibili
Condizione: New. Computational complexity theory is the study of the quantitative laws that govern computing. This book contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. Editor(s): Hartmanis, Juris. Series: Proceedings of Symposia in Applied Mathematics. Num Pages: 128 pages. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 454. . 1989. Hardcover. . . . . …

- Rilegato
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 130,45
EUR 11,67 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Hardcover. Condizione: Brand New. 128 pages. 10.50x7.25x0.75 inches. In Stock.

- Brossura
Da: Rarewaves.com USA, London, LONDO, Regno UnitoRarewaves.com USA
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 142,74
Spedizione gratuitaSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathematicians as well, since some of the key open problems in this field raise basic questions about the nature of mathematics. Many experts in complexity theory believe that, in coming decades, the strongest influence on the development of mathematics will come from the extended use of computing and from concepts and problems arising in computer science.This volume contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. The purpose of the short course was to provide an overview of complexity theory and to describe some of the current developments in the field. The papers presented here represent contributions by some of the top experts in this burgeoning area of research.…

- Rilegato
Da: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 142,08
EUR 9,06 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Condizione: New. Computational complexity theory is the study of the quantitative laws that govern computing. This book contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. Editor(s): Hartmanis, Juris. Series: Proceedings of Symposia in Applied Mathematics. Num Pages: 128 pages. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 454. . 1989. Hardcover. . . . . Books ship from the US and Ireland. …

- Rilegato
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 170,26
EUR 13,17 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Condizione: New. In English.

- Brossura
Da: Rarewaves.com UK, London, Regno UnitoRarewaves.com UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 139,92
EUR 75,83 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: New. Computational complexity theory is the study of the quantitative laws that govern computing. During the last 25 years, this field has grown into a rich mathematical theory. Currently one of the most active research areas in computer science, complexity theory is of considerable interest to mathematicians as well, since some of the key open problems in this field raise basic questions about the nature of mathematics. Many experts in complexity theory believe that, in coming decades, the strongest influence on the development of mathematics will come from the extended use of computing and from concepts and problems arising in computer science.This volume contains the proceedings of the AMS Short Course on Computational Complexity Theory, held at the Joint Mathematics Meetings in Atlanta in January 1988. The purpose of the short course was to provide an overview of complexity theory and to describe some of the current developments in the field. The papers presented here represent contributions by some of the top experts in this burgeoning area of research.…