| 000 | 03657nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | vtls000542992 | ||
| 003 | RU-ToGU | ||
| 005 | 20210922082401.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 160915s2014 gw | s |||| 0|eng d | ||
| 020 |
_a9783319054469 _9978-3-319-05446-9 |
||
| 024 | 7 |
_a10.1007/978-3-319-05446-9 _2doi |
|
| 035 | _ato000542992 | ||
| 040 |
_aSpringer _cSpringer _dRU-ToGU |
||
| 050 | 4 | _aQA8.9-10.3 | |
| 072 | 7 |
_aPBC _2bicssc |
|
| 072 | 7 |
_aPBCD _2bicssc |
|
| 072 | 7 |
_aMAT018000 _2bisacsh |
|
| 082 | 0 | 4 |
_a511.3 _223 |
| 245 | 1 | 0 |
_aPerspectives in Computational Complexity _helectronic resource _bThe Somenath Biswas Anniversary Volume / _cedited by Manindra Agrawal, Vikraman Arvind. |
| 260 |
_aCham : _bSpringer International Publishing : _bImprint: Birkhäuser, _c2014. |
||
| 300 |
_aX, 202 p. 8 illus., 1 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aProgress in Computer Science and Applied Logic ; _v26 |
|
| 505 | 0 | _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). | |
| 520 | _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. | ||
| 650 | 0 |
_amathematics. _9566183 |
|
| 650 | 0 |
_aComputer Science. _9155490 |
|
| 650 | 0 |
_aLogic, Symbolic and mathematical. _9293145 |
|
| 650 | 1 | 4 |
_aMathematics. _9566184 |
| 650 | 2 | 4 |
_aMathematical Logic and Foundations. _9306112 |
| 650 | 2 | 4 |
_aComputational Science and Engineering. _9304944 |
| 650 | 2 | 4 |
_aMathematical Logic and Formal Languages. _9303363 |
| 700 | 1 |
_aAgrawal, Manindra. _eeditor. _9331168 |
|
| 700 | 1 |
_aArvind, Vikraman. _eeditor. _9448507 |
|
| 710 | 2 |
_aSpringerLink (Online service) _9143950 |
|
| 773 | 0 | _tSpringer eBooks | |
| 830 | 0 |
_aProgress in Computer Science and Applied Logic ; _9447212 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-319-05446-9 |
| 912 | _aZDB-2-SMA | ||
| 999 | _c400194 | ||