Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume - Couverture souple

Couverture souple

ISBN 10 : 3319350587 ISBN 13 : 9783319350585

Editeur : Birkhäuser, 2016

Synopsis

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.

A propos du livre

À propos de l'auteur

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.

À propos de la quatrième de couverture

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.

Détails de l'édition

• Éditeur: Birkhäuser
• Date d'édition: 2016
• Langue: anglais
• ISBN 10: 3319350587
• ISBN 13: 9783319350585
• Reliure: Broché
• Nombre de pages: 212
• Éditeur: Agrawal Manindra, Arvind Vikraman
• Coordonnées du fabricant: Springer Nature Customer Service Center GmbH; ProductSafety@springernature.com; ; Europaplatz 3; Heidelberg; 69115; Allemagne