The Resource Perspectives in computational complexity : the Somenath Biswas anniversary volume, Manindra Agrawal, Vikraman Arvind, editors

Perspectives in computational complexity : the Somenath Biswas anniversary volume, Manindra Agrawal, Vikraman Arvind, editors

Label
Perspectives in computational complexity : the Somenath Biswas anniversary volume
Title
Perspectives in computational complexity
Title remainder
the Somenath Biswas anniversary volume
Statement of responsibility
Manindra Agrawal, Vikraman Arvind, editors
Contributor
Editor
Honoree
Subject
Language
eng
Summary
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
Member of
Cataloging source
GW5XE
Dewey number
511.3
Illustrations
illustrations
Index
no index present
LC call number
QA9
Literary form
non fiction
Nature of contents
dictionaries
Series statement
Progress in Computer Science and Applied Logic
Series volume
volume 26
Label
Perspectives in computational complexity : the Somenath Biswas anniversary volume, Manindra Agrawal, Vikraman Arvind, editors
Publication
Antecedent source
unknown
http://library.link/vocab/branchCode
  • net
Carrier category
online resource
Carrier category code
cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
txt
Content type MARC source
rdacontent
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)
Control code
ocn884963705
Dimensions
unknown
Extent
1 online resource (x, 202 pages)
File format
unknown
Form of item
online
Isbn
9783319054469
Media category
computer
Media MARC source
rdamedia
Media type code
c
Other control number
10.1007/978-3-319-05446-9
Other physical details
illustrations (some color)
Quality assurance targets
unknown
http://library.link/vocab/recordID
.b31761410
Sound
unknown sound
Specific material designation
remote
System control number
  • (OCoLC)884963705
  • springer3319054457

Library Locations

    • Deakin University Library - Geelong Waurn Ponds CampusBorrow it
      75 Pigdons Road, Waurn Ponds, Victoria, 3216, AU
      -38.195656 144.304955
Processing Feedback ...