Recursion Theory and Computational Complexity
Material type:
Computer fileLanguage: English Publication details: Berlin, Heidelberg Springer Berlin Heidelberg 2011. ISBN: 9783642110726, 978-3-642-11072-6Subject(s): Logic, Symbolic and mathematical | Mathematical Logic and Foundations | Mathematics | MathematicsDDC classification: 511.3, Online resources: Click here to access online
| Item type | Current library | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
E(electronic)-Books
|
NISER LIBRARY | 511.3, 23 (Browse shelf(Opens below)) | Available | E2007 |
Browsing NISER LIBRARY shelves Close shelf browser (Hides shelf browser)
| 511.3, 23 Proof Theory | 511.3, 23 Ernst Zermelo - Collected Works/Gesammelte Werke | 511.3, 23 Teoria algebrica dei meccanismi automatici | 511.3, 23 Recursion Theory and Computational Complexity | 511.3, 23 Aspects of Mathematical Logic | 511.3, 23 Model Theory and Applications | 511.3, 23 Hyperfinite Dirichlet Forms and Stochastic Processes |
Mathematics and Statistics (Springer-11649)
There are no comments on this title.