Skip to main content
SpringerLink
Log in
Birkhäuser

Perspectives in Computational Complexity

The Somenath Biswas Anniversary Volume

  • Book
  • © 2014

Overview

Editors:
  1. Manindra Agrawal

    1. Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, Kanpur, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Vikraman Arvind

    1. CIT Campus, Institute of Mathematical Sciences, Chennai, India

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • 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
  • Includes supplementary material: sn.pub/extras

Part of the book series: Progress in Computer Science and Applied Logic (PCS, volume 26)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (11 chapters)

  1. Front Matter

    Pages i-x
    Download chapter PDF

  2. Complexity Theory Basics: NP and NL

    • Vikraman Arvind
    Pages 1-22

  3. Investigations Concerning the Structure of Complete Sets

    • Eric Allender
    Pages 23-35

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

    • N. Variyam Vinodchandran
    Pages 37-49

  5. Algebraic Complexity Classes

    • Meena Mahajan
    Pages 51-75

  6. A Selection of Lower Bounds for Arithmetic Circuits

    • Neeraj Kayal, Ramprasad Saptharishi
    Pages 77-115

  7. Explicit Tensors

    • Markus Bläser
    Pages 117-130

  8. Progress on Polynomial Identity Testing-II

    • Nitin Saxena
    Pages 131-146

  9. Malod and the Pascaline

    • Bruno Poizat
    Pages 147-157

  10. A Tutorial on Time and Space Bounds in Tree-Like Resolution

    • Jacobo Torán
    Pages 159-172

  11. An Entropy-Based Proof for the Moore Bound for Irregular Graphs

    • S. Ajesh Babu, Jaikumar Radhakrishnan
    Pages 173-181

  12. Permutation Groups and the Graph Isomorphism Problem

    • Sumanta Ghosh, Piyush P Kurur
    Pages 183-202
Back to top

Keywords

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.

Editors and Affiliations

  • Department of Computer Science and Engineering, Indian Institute of Technology, Kanpur, India, Kanpur, India

    Manindra Agrawal

  • CIT Campus, Institute of Mathematical Sciences, Chennai, India

    Vikraman Arvind

About the editors

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation