TY  - BOOK
AU  - Agrawal,Manindra
AU  - Arvind,Vikraman
ED  - SpringerLink (Online service)
TI  - Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume 
T2  - Progress in Computer Science and Applied Logic
SN  - 9783319054469
AV  - QA8.9-10.3 
U1  - 511.3 23
PY  - 2014///
CY  - Cham
PB  - Springer International Publishing, Imprint: Birkhäuser
KW  - mathematics
KW  - Computer Science
KW  - Logic, Symbolic and mathematical
KW  - Mathematics
KW  - Mathematical Logic and Foundations
KW  - Computational Science and Engineering
KW  - Mathematical Logic and Formal Languages
N1  - 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)
N2  - 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
UR  - http://dx.doi.org/10.1007/978-3-319-05446-9
ER  -