Progress in Computer Science and Applied Logic

Perspectives in Computational Complexity

The Somenath Biswas Anniversary Volume

Editors: Agrawal, Manindra, Arvind, Vikraman (Eds.)

  • Accessible and self-contained text addressing both graduate students and researchers
  • Two introductory chapters provide basic background material
  • Leads the reader to research level questions in various topics of current interest in computational complexity
see more benefits

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-319-05446-9
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $109.00
price for USA
  • ISBN 978-3-319-05445-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $109.00
price for USA
  • Customers within the U.S. and Canada please contact Customer Service at 1-800-777-4643, Latin America please contact us at +1-212-460-1500 (Weekdays 8:30am – 5:30pm ET) to place your order.
  • Due: October 6, 2016
  • ISBN 978-3-319-35058-5
  • Free shipping for individuals worldwide
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
About this book

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.

About the authors

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.

Table of contents (11 chapters)

  • Complexity Theory Basics: NP and NL

    Arvind, Vikraman

    Pages 1-22

  • Investigations Concerning the Structure of Complete Sets

    Allender, Eric

    Pages 23-35

  • Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs

    Vinodchandran, N. Variyam

    Pages 37-49

  • Algebraic Complexity Classes

    Mahajan, Meena

    Pages 51-75

  • A Selection of Lower Bounds for Arithmetic Circuits

    Kayal, Neeraj (et al.)

    Pages 77-115

Buy this book

eBook $79.99
price for USA (gross)
  • ISBN 978-3-319-05446-9
  • Digitally watermarked, DRM-free
  • Included format: EPUB, PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $109.00
price for USA
  • ISBN 978-3-319-05445-2
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $109.00
price for USA
  • Customers within the U.S. and Canada please contact Customer Service at 1-800-777-4643, Latin America please contact us at +1-212-460-1500 (Weekdays 8:30am – 5:30pm ET) to place your order.
  • Due: October 6, 2016
  • ISBN 978-3-319-35058-5
  • Free shipping for individuals worldwide
Rent the ebook  
  • Rental duration: 1 or 6 month
  • low-cost access
  • online reader with highlighting and note-making option
  • can be used across all devices
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Perspectives in Computational Complexity
Book Subtitle
The Somenath Biswas Anniversary Volume
Editors
  • Manindra Agrawal
  • Vikraman Arvind
Series Title
Progress in Computer Science and Applied Logic
Series Volume
26
Copyright
2014
Publisher
Birkhäuser Basel
Copyright Holder
Springer International Publishing Switzerland
eBook ISBN
978-3-319-05446-9
DOI
10.1007/978-3-319-05446-9
Hardcover ISBN
978-3-319-05445-2
Softcover ISBN
978-3-319-35058-5
Series ISSN
2297-0576
Edition Number
1
Number of Pages
X, 202
Number of Illustrations and Tables
7 b/w illustrations, 1 illustrations in colour
Topics