
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.
- paperback
- 206 Seiten
- Erschienen 1989
- Springer
- Gebunden
- 2264 Seiten
- Erschienen 2012
- Springer
- Kartoniert
- 408 Seiten
- Erschienen 2003
- Springer
- Hardcover
- 424 Seiten
- Erschienen 1991
- Vieweg Verlagsgesellschaft
- hardcover
- 658 Seiten
- Erschienen 1988
- Elsevier Science Ltd
- Gebunden
- 347 Seiten
- Erschienen 2011
- Springer
- Kartoniert
- 1078 Seiten
- Erschienen 2001
- Springer
- paperback
- 388 Seiten
- Erschienen 2000
- Springer
- hardcover
- 272 Seiten
- Erschienen 2024
- Wiley-ISTE
- hardcover
- 514 Seiten
- Erschienen 1982
- Birkhäuser Verlag
- Hardcover
- 300 Seiten
- Erschienen 1971
- Springer