Computation models and function algebras-Reference-Cited by-同舟云学术

Computation models and function algebras

Published:1995 Issue: Volume: Page:98-130
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Clote Peter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-60178-3_81

Reference92 articles.

1. W. Ackermann. Zum Hilbertschen Aufbau der reelen Zahlen. Mathematische Annalen, 99:118–133, 1928.

2. B. Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53(1):1–50, 1991.

3. D. Mix Barrington, N. Immerman, and H. Straubing. On uniformity in NC 1. Journal of Computer and System Science, 41(3):274–306, 1990.

4. D.A. Barrington. Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1. Journal of Computer and System Sciences, 38:150–164, 1989.

5. S. Bellantoni. Predicative recursion and computational complexity. Technical Report 264/92, University of Toronto, Computer Science Department, September 1992. 164 pages.

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Categorical comprehensions and recursion;Journal of Logic and Computation;2016-06-25

2. Implicit complexity over an arbitrary structure: Quantifier alternations;Information and Computation;2006-02

3. A Characterization of Alternating Log Time by First Order Functional Programs;Logic for Programming, Artificial Intelligence, and Reasoning;2006

4. Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures;IFIP International Federation for Information Processing;2004

5. Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time;Lecture Notes in Computer Science;2003