Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume (Progress in Computer Science and Applied Logic, 26) - Hardcover

Hardcover

ISBN 10: 3319054457 ISBN 13: 9783319054452

Publisher: Birkhäuser, 2014

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.

About this title

About the Author

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.

From the Back Cover

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.

Edition details

• Publisher: Birkhäuser
• Publication date: 2014
• Language: English
• ISBN 10: 3319054457
• ISBN 13: 9783319054452
• Binding: Hardcover
• Number of pages: 212
• Editor: Agrawal Manindra, Arvind Vikraman