| Shelfclass |
Sortkey |
Title |
| 3.D.4 |
AMADIO, ROBERTO M |
Domains and Lambda-Calculi |
| 3.D.4 |
BALCÁZAR, JOSÉ LUIS |
Structural Complexity I: I |
| 3.D.4 |
BARENDREGT, H. P |
The Lambda Calculus: Its Syntax and Semantics |
| 3.D.4 |
BLAHA, STEPHEN |
The Equivalence of Elementary Particle Theories and Computer Languages |
| 3.D.4 |
BOOLOS, GEORGE S |
Computability and Logic |
| 3.D.4 |
BÜRGISSER, PETER |
Completeness and Reduction in Algebraic Complexity Theory |
| 3.D.4 |
CHURCH, ALONZO |
The Calculi of Lambda-Conversion |
| 3.D.4 |
CLARK, KEITH |
Programs, Machines, and Computation: An Introduction to the Theory of Computing |
| 3.D.4 |
CROCHEMORE, MAXIME |
Algorithms on Strings |
| 3.D.4 |
DAVIS, MARTIN |
Computability & Unsolvability |
| 3.D.4 |
DOWNEY, ROD |
Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra: Mathematics Workshop, Kaikoura, January 7-15, 2000 |
| 3.D.4 |
EBBINGHAUS, HEINZ-DIETER |
Finite Model Theory |
| 3.D.4 |
GAREY, MICHAEL R |
Computers and Intractability: A Guide to the Theory of NP-Completeness |
| 3.D.4 |
GOLDREICH, ODED |
Computational Complexity: A Conceptual Perspective |
| 3.D.4 |
HANKIN, CHRIS |
Lambda Calculi: A Guide for the Perplexed |
| 3.D.4 |
HARTMANIS, JURIS |
Feasible Computations and Provable Complexity Properties |
| 3.D.4 |
HINDLEY, J. ROGER |
Introduction to Combinators and [lambda]-Calculus |
| 3.D.4 |
KFOURY, A. J |
A Programming Approach to Computability |
| 3.D.4 |
KO, KER-I |
Complexity Theory of Real Functions |
| 3.D.4 |
LIBKIN, LEONID |
Elements of Finite Model Theory |
| 3.D.4 |
LI, MING |
An Introduction to Kolmogorov Complexity and Its Applications |
| 3.D.4 |
MALCEV, A. I |
Algorithms and Recursive Functions |
| 3.D.4 |
MARKOV, A. A |
Theory of Algorithms |
| 3.D.4 |
MAYR, ERNST W |
Lectures on Proof Verification and Approximation Algorithms |
| 3.D.4 |
MEINEL, CHRISTOPH |
Modified Branching Programs and Their Computational Power |
| 3.D.4 |
MINSKY, MARVIN LEE |
Computation: Finite and Infinite Machines |
| 3.D.4 |
MOGENSEN, TORBEN AE |
The Essence of Computation: Complexity, Analysis, Transformation: Essays Dedicated to Neil D. Jones |
| 3.D.4 |
PÉTER, RÓZSA |
Recursive Functions in Computer Theory |
| 3.D.4 |
SAVAGE, JOHN E. |
The Complexity of Computing |
| 3.D.4 |
SCHMIDT, H. ARNOLD |
Contributions to Mathematical Logic: Proceedings of the Logic Colloquium, Hannover 1966 |
| 3.D.4 |
SIPPER, MOSHE |
Evolution of Parallel Cellular Machines: The Cellular Programming Approach |
| 3.D.4 |
SPECKER, ERNST |
Komplexität von Entscheidungsproblemen: Ein Seminar |
| 3.D.4 |
SZEPIETOWSKI, ANDRZEJ |
Turing Machines with Sublogarithmic Space |
| 3.D.4 |
TAYLOR, RALPH GREGORY |
Models of Computation and Formal Languages |
| 3.D.4 |
THIERAUF, THOMAS |
The Computational Complexity of Equivalence and Isomorphism Problems |
| 3.D.4 |
TRAUB, J. F |
Information, Uncertainty, Complexity |
| 3.D.4 |
VAN MELKEBEEK, DIETER |
Randomness and Completeness in Computational Complexity |
| 3.D.4 |
WATANABE, OSAMU |
Kolmogorov Complexity and Computational Complexity |
| 3.D.4 |
YASUHARA, ANN |
Recursive Function Theory and Logic |