logo

EbookBell.com

Most ebook files are in PDF format, so you can easily read them using various software such as Foxit Reader or directly on the Google Chrome browser.
Some ebook files are released by publishers in other formats such as .awz, .mobi, .epub, .fb2, etc. You may need to install specific software to read these formats on mobile/PC, such as Calibre.

Please read the tutorial at this link:  https://ebookbell.com/faq 


We offer FREE conversion to the popular formats you request; however, this may take some time. Therefore, right after payment, please email us, and we will try to provide the service as quickly as possible.


For some exceptional file formats or broken links (if any), please refrain from opening any disputes. Instead, email us first, and we will try to assist within a maximum of 6 hours.

EbookBell Team

Perspectives In Computational Complexity The Somenath Biswas Anniversary Volume 1st Edition Manindra Agrawal

  • SKU: BELL-4930624
Perspectives In Computational Complexity The Somenath Biswas Anniversary Volume 1st Edition Manindra Agrawal
$ 31.00 $ 45.00 (-31%)

4.0

16 reviews

Perspectives In Computational Complexity The Somenath Biswas Anniversary Volume 1st Edition Manindra Agrawal instant download after payment.

Publisher: Birkhäuser Basel
File Extension: PDF
File size: 8.76 MB
Pages: 202
Author: Manindra Agrawal, Vikraman Arvind (eds.)
ISBN: 9783319054452, 9783319054469, 3319054457, 3319054465
Language: English
Year: 2014
Edition: 1

Product desciption

Perspectives In Computational Complexity The Somenath Biswas Anniversary Volume 1st Edition Manindra Agrawal by Manindra Agrawal, Vikraman Arvind (eds.) 9783319054452, 9783319054469, 3319054457, 3319054465 instant download after payment.

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.

Related Products