rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Perspectives in Computational Complexity
    sub title: The Somenath Biswas Anniversary Volume
  name:
    name part: Agrawal, Manindra.
    role:
      role term: editor.
  name:
    name part: Arvind, Vikraman.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2014
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: X, 202 p. 8 illus., 1 illus. in color. online resource.
  abstract: 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.
  table of contents: Preface -- 1. Complexity Theory Basics: NP and NL (Vikraman Arvind) -- 2. Investigations Concerning the Structure of Complete Sets (Eric Allender) -- 3. Space Complexity of the Directed Reachability Problem Over Surface-embedded Graphs (N.V. Vinodchandran) -- 4. Algebraic Complexity Classes (Meena Mahajan) -- 5. A Selection of Lower Bound Results for Arithmetic Circuits (Neeraj Kayal and Ramprasad Saptharishi) -- 6. Explicit Tensors (Markus Bläser) -- 7. Progress on Polynomial Identity Testing (Nitin Saxena) -- 8. Malod and the Pascaline (Bruno Poizat) -- 9. A Tutorial in Time and Space Bounds for Tree-like Resolution (Jacobo Torán) -- 10. An Entropy Based Proof for the Moore Bound for Irregular Graphs (S. Ajesh Babu and Jaikumar Radharishnan) -- 11. Permutation Groups and the Graph Isomorphism Problem (Sumanta Ghosh and Piyush P. Kurur).
  note: edited by Manindra Agrawal, Vikraman Arvind.
  subject:
    topic: Mathematics
  subject:
    topic: Mathematical logic
  subject:
    topic: Computer mathematics
  subject:
    topic: Mathematics
  subject:
    topic: Mathematical Logic and Foundations
  subject:
    topic: Computational Science and Engineering
  subject:
    topic: Mathematical Logic and Formal Languages
  classification: QA8.9-10.3
  classification: 511.3
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Progress in Computer Science and Applied Logic ; 26
  identifier: 9783319054469
  identifier: http://dx.doi.org/10.1007/978-3-319-05446-9
  record info:
    record creation date: 140716
    record change date: 20151029201114.0
    record identifier: 978-3-319-05446-9