CS801: Advanced Complexity
TB = Textbook or Required reading 
REF = Reference or supplemental reading
|
Type |
..................... | Title |
eBook |
|
Call Number |
|
 |
D. Du, K. Ko, Theory of Computational Complexity, Wiley-Interscience, 2014.
|
Yes | QA267.7 .D8 2014 | |
|
 |
S, Arora, B, Barak, Computational Complexity: A Modern Approach, Cambridge University Press, 2009. | Cambridge.org | Yes | QA267.7 .A76 2009 |
|
 |
C. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
|
NA | NA | |
|
 |
O. Goldreich, Computational Complexity: A Conceptual Perspective, Cambridge University Press, 2009. | Cambridge Core | Yes | QA267.7 .G65 2008 |
|
 |
L.A Hemaspaandra, and M. Ogihara, A Rogues’ Gallery of Complexity Classes, The Complexity Theory Companion, Springer, 2002. | Yes | QA267.7 .H46 2002 | |
|
 |
D. C. Kozen, Theory of Computation, Texts in Computer Science. Springer, 2006. |
Yes | ||
|
 |
S. Homer, A. L. Selman, Computability and Complexity Theory, Springer Verlag New York, 2011. | Yes | QA76 .H6647 2011 | |
|
 |
J. Balcazar, J. Diaz, J. Gabarro, Structural Complexity I. Springer Verlad, 1988. J. Balcazar, J. Diaz, J. Gabarro, Structural Complexity II. Springer Verlad, 1990. |
|
Yes |
QA75.5 B353 1990 |
|
 |
S. Jukna, Boolean Function Complexity: Advances and Frontiers. Springer, 2012. | Yes | QA267.7 .J85 2012 | |
|
 |
C. Moore, S. Mertens, The Nature of Computation. Oxford University Press, 2011. | ProQuest | Yes | QA267.7 .M667 2011 |
|
 |
M. Sipser, Introduction to the Theory of Computation, Thomson Course Technology, 2006. | NA | Yes | QA 267 .S56 2020 |