Book contents
- Frontmatter
- Contents
- Introduction
- 1 Preliminaries
- Part I Abstract (first order) recursion
- Part II Intrinsic complexity
- 4 The homomorphism method
- 5 Lower bounds from Presburger primitives
- 6 Lower bounds from division with remainder
- 7 Lower bounds from division and multiplication
- 8 Non-uniform complexity in N
- 9 Polynomial nullity (0-testing)
- References
- Symbol index
- General index
8 - Non-uniform complexity in N
from Part II - Intrinsic complexity
Published online by Cambridge University Press: 23 November 2018
- Frontmatter
- Contents
- Introduction
- 1 Preliminaries
- Part I Abstract (first order) recursion
- Part II Intrinsic complexity
- 4 The homomorphism method
- 5 Lower bounds from Presburger primitives
- 6 Lower bounds from division with remainder
- 7 Lower bounds from division and multiplication
- 8 Non-uniform complexity in N
- 9 Polynomial nullity (0-testing)
- References
- Symbol index
- General index
Summary
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Abook%3A9781108234238/resource/name/firstPage-9781108415583c8_203-208.jpg)
- Type
- Chapter
- Information
- Abstract Recursion and Intrinsic Complexity , pp. 203 - 208Publisher: Cambridge University PressPrint publication year: 2018