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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
Manindra Agrawal is Professor at the Department of Computer Science and Engineering of the Indian Institute of Technology in Kanpur, India.
Vikraman Arvind is Professor at the Institute of Mathematical Sciences of the CIT Campus in Chennai, India.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 45,00 für den Versand von Deutschland nach USA
Versandziele, Kosten & DauerEUR 14,08 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerAnbieter: Buchpark, Trebbin, Deutschland
Zustand: Sehr gut. Zustand: Sehr gut - Buchschnitt verkürzt - gepflegter, sauberer Zustand - Ausgabejahr 2014 | Seiten: 212 | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 24841980/12
Anzahl: 1 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In. Artikel-Nr. ria9783319054452_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: 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. Artikel-Nr. 9783319054452
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Gebunden. Zustand: New. Artikel-Nr. 4497278
Anzahl: Mehr als 20 verfügbar