Perspectives in Computational Complexity
The Somenath Biswas Anniversary Volume
Nonfiction, Science & Nature, Mathematics, Logic, Computers, Advanced Computing, Computer Science
| Author: | ISBN: | 9783319054469 | |
| Publisher: | Springer International Publishing | Publication: | July 16, 2014 |
| Imprint: | Birkhäuser | Language: | English |
| Author: | |
| ISBN: | 9783319054469 |
| Publisher: | Springer International Publishing |
| Publication: | July 16, 2014 |
| Imprint: | Birkhäuser |
| Language: | English |
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.
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.
