E-Book, Englisch, Band 26, 202 Seiten
Agrawal / Arvind Perspectives in Computational Complexity
1. Auflage 2014
ISBN: 978-3-319-05446-9
Verlag: Springer Nature Switzerland
Format: PDF
Kopierschutz: 1 - PDF Watermark
The Somenath Biswas Anniversary Volume
E-Book, Englisch, Band 26, 202 Seiten
Reihe: Progress in Computer Science and Applied Logic
ISBN: 978-3-319-05446-9
Verlag: Springer Nature Switzerland
Format: PDF
Kopierschutz: 1 - PDF Watermark
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.
