LEADER 04305nam  22006615  450 
001 9910299982303321
005 20250609110737.0
010   $a3-319-05446-5
024 7 $a10.1007/978-3-319-05446-9
035   $a(CKB)3710000000202559
035   $a(EBL)1782233
035   $a(OCoLC)889312698
035   $a(SSID)ssj0001298058
035   $a(PQKBManifestationID)11987041
035   $a(PQKBTitleCode)TC0001298058
035   $a(PQKBWorkID)11241874
035   $a(PQKB)11644953
035   $a(MiAaPQ)EBC1782233
035   $a(DE-He213)978-3-319-05446-9
035   $a(PPN)188371532
035   $a(MiAaPQ)EBC6241679
035   $a(EXLCZ)993710000000202559
100   $a20140716d2014      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt
182   $cc
183   $acr
200 10$aPerspectives in computational complexity $ethe Somenath Biswas anniversary volume /$fedited by Manindra Agrawal, Vikraman Arvind
205   $a1st ed. 2014.
210  1$aCham :$cSpringer International Publishing :$cImprint: Birkhäuser,$d2014.
215   $a1 online resource (206 p.)
225 1 $aProgress in Computer Science and Applied Logic,$x2297-0576 ;$v26
300   $aDescription based upon print version of record.
311 08$a3-319-05445-7 
320   $aIncludes bibliographical references at the end of each chapters.
327   $aPreface -- 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).
330   $aThis 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.
410  0$aProgress in Computer Science and Applied Logic,$x2297-0576 ;$v26
606   $aLogic, Symbolic and mathematical
606   $aComputer science$xMathematics
606   $aMathematical Logic and Foundations$3https://scigraph.springernature.com/ontologies/product-market-codes/M24005
606   $aComputational Science and Engineering$3https://scigraph.springernature.com/ontologies/product-market-codes/M14026
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
615  0$aLogic, Symbolic and mathematical.
615  0$aComputer science$xMathematics.
615 14$aMathematical Logic and Foundations.
615 24$aComputational Science and Engineering.
615 24$aMathematical Logic and Formal Languages.
676   $a511.3
676   $a511.3/6
676   $a511.352
702   $aAgrawal$b Manindra$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aArvind$b Vikraman$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910299982303321
996   $aPerspectives in computational complexity$91410274
997   $aUNINA