 | Institut Mittag-Leffler The Royal Swedish
Academy of Sciences |
The Strength of Non-Size Increasing Computation
Source file as TeX DVI Data
Postscript Document
Portable Document Format
Martin Hofmann
Preprint series:
Mathematical Logic - 2000/2001, No. 28
MSC 2000
- 03D15 Complexity of computation
-
03C13 Finite structures
-
68Q15 Complexity classes (hierarchies, relations among complexity classes, etc.)
-
68Q55 Semantics
Keywords:
computational complexity, higher-order functions, finite model, semantics