Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume: 26 - Brossura

Brossura

ISBN 10: 3319350587 ISBN 13: 9783319350585

Casa editrice: Birkhäuser, 2016

Riassunto

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.

Su questo libro

Informazioni sull?autore

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.

Dalla quarta di copertina

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.

Dettagli dell'edizione

• Editore: Birkhäuser
• Data di pubblicazione: 2016
• Lingua: Inglese
• ISBN 10: 3319350587
• ISBN 13: 9783319350585
• Rilegatura: Copertina flessibile
• Numero di pagine: 212
• Redattore: Agrawal Manindra, Arvind Vikraman
• Contatto del produttore: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Uhlandstraße 14; Stuttgart; 70182; Germania