Perspectives in Computational Complexity The Somenath Biswas Anniversary Volume /

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 v...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Agrawal, Manindra (Editor ), Arvind, Vikraman (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Birkhäuser, 2014.
Edición:1st ed. 2014.
Colección:Progress in Computer Science and Applied Logic, 26
Temas:
Mathematical logic.
Mathematics-Data processing.
Machine theory.
Mathematical Logic and Foundations.
Computational Science and Engineering.
Formal Languages and Automata Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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).

Ejemplares similares