Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time
- 28 February 2003
- book chapter
- Published by Springer Nature
- p. 185-199
- https://doi.org/10.1007/3-540-36576-1_12
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Safe Recursion Over an Arbitrary Structure: PAR, PH and DPHElectronic Notes in Theoretical Computer Science, 2003
- The expressive power of higher-order types or, life without CONSJournal of Functional Programming, 2001
- Computation models and function algebrasLecture Notes in Computer Science, 1995
- Separation of complexity classes in Koiran's weak modelTheoretical Computer Science, 1994
- Accessible telephone directoriesThe Journal of Symbolic Logic, 1994
- A note on a P ≠ NP result for a restricted class of real machinesJournal of Complexity, 1992
- PR ≠ NCRJournal of Complexity, 1992
- A new recursion-theoretic characterization of the polytime functionscomputational complexity, 1992
- Computability and Complexity of Higher Type FunctionsPublished by Springer Nature ,1992
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989