Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 111,59
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
EUR 111,93
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Buchpark, Trebbin, Germania
EUR 11,57
Quantità: 1 disponibili
Aggiungi al carrelloCondizione: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 122,92
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: Ria Christie Collections, Uxbridge, Regno Unito
EUR 122,92
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New. In.
Da: California Books, Miami, FL, U.S.A.
EUR 137,73
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: California Books, Miami, FL, U.S.A.
EUR 137,73
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Da: Chiron Media, Wallingford, Regno Unito
EUR 124,04
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Editore: Springer (India) Private Limited, 2016
ISBN 10: 3319350587 ISBN 13: 9783319350585
Lingua: Inglese
Da: Books Puddle, New York, NY, U.S.A.
Condizione: New. pp. 212 Softcover reprint of the original 1st ed. 2014 edition NO-PA16APR2015-KAP.
Da: Revaluation Books, Exeter, Regno Unito
EUR 165,91
Quantità: 2 disponibili
Aggiungi al carrelloHardcover. Condizione: Brand New. anv edition. 202 pages. 9.75x6.75x0.75 inches. In Stock.
Editore: Springer International Publishing, 2016
ISBN 10: 3319350587 ISBN 13: 9783319350585
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 117,69
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.
Editore: Springer International Publishing, 2014
ISBN 10: 3319054457 ISBN 13: 9783319054452
Lingua: Inglese
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 117,69
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity.
Da: Revaluation Books, Exeter, Regno Unito
EUR 163,93
Quantità: 2 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. reprint edition. 212 pages. 9.25x6.10x0.50 inches. In Stock.
Da: Mispah books, Redhill, SURRE, Regno Unito
EUR 173,24
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: Like New. Like New. book.
Editore: Springer (India) Private Limited, 2016
ISBN 10: 3319350587 ISBN 13: 9783319350585
Lingua: Inglese
Da: Majestic Books, Hounslow, Regno Unito
EUR 151,80
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 212.
Editore: Springer (India) Private Limited, 2016
ISBN 10: 3319350587 ISBN 13: 9783319350585
Lingua: Inglese
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 153,61
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 212.
Editore: Springer International Publishing, 2014
ISBN 10: 3319054457 ISBN 13: 9783319054452
Lingua: Inglese
Da: preigu, Osnabrück, Germania
EUR 105,50
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Perspectives in Computational Complexity | The Somenath Biswas Anniversary Volume | Vikraman Arvind (u. a.) | Buch | x | Englisch | 2014 | Springer International Publishing | EAN 9783319054452 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.