Perspectives in Computational Complexity
Kurzinformation
inkl. MwSt. Versandinformationen
Artikel zZt. nicht lieferbar
Artikel zZt. nicht lieferbar
Beschreibung
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. von Agrawal, Manindra und Arvind, Vikrama
Produktdetails
So garantieren wir Dir zu jeder Zeit Premiumqualität.
Über den Autor
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.
- Hardcover
- 372 Seiten
- Erschienen 1995
- De Gruyter
- Hardcover
- 540 Seiten
- Erschienen 2011
- De Gruyter
- Hardcover
- 272 Seiten
- De Gruyter Oldenbourg
- Hardcover
- 304 Seiten
- De Gruyter