Perspectives in Computational Complexity

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.

• 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).