In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes The name was coined… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2005

2005

- Endang Lestari, D Hidayah, M K Suci, Mustafa Riza, S Martuti
- Pediatric Research
- 2005

OBJECTIVE: TO EXAMINE THE PREVALENCE OF SOCIAL MATURITY AND THE INFLUENCE FACTORS AMONG OBESE CHILDREN FROM ELEMENTARY SCHOOL IN… (More)

Is this relevant?

2004

2004

- Hans–Werner Henn
- 2004

1.1 Let G be a profinite group and p be a fixed prime. In this paper we will be concerned with H∗ c (G;Fp), the continuous… (More)

Is this relevant?

2003

2003

- Vincent Danos, Jean-Baptiste Joinet
- Inf. Comput.
- 2003

A subsystem of linear logic, elementary linear logic, is defined and shown to represent exactly elementary recursive functions… (More)

Is this relevant?

2003

2003

Elliptic 6j-symbols first appeared in connection with solvable models of statistical mechanics. They include many interesting… (More)

Is this relevant?

2001

2001

- Vincent Danos
- 2001

Think of elementary linear logic as an idealized functional programming language with a severe typing mechanism. Definition by… (More)

Is this relevant?

2001

2001

- George Cybenko
- Computing in Science and Engineering
- 2001

27 Quantum computing has enormous potential for introducing fundamentally new capabilities to computational science and… (More)

Is this relevant?

2000

2000

- Andrea Asperti, Paolo Coppola, Simone Martini
- Inf. Comput.
- 2000

In 1998 Asperti and Mairson proved that the cost of reducing a lambda-term using an optimal lambda-reducer (a la Lévy) cannot be… (More)

Is this relevant?

1998

1998

- Andrea Asperti, Harry G. Mairson
- Inf. Comput.
- 1998

We analyze the inherent complexity of implementing Lévy's notion of optimal evaluation for the &lambda-calculus, where… (More)

Is this relevant?

1996

1996

- Richard Sommer
- 1996

This paper provides a new proof of the consistency of a formal system similar to the one presented by Chuaqui and Suppes in 2, 9… (More)

Is this relevant?

1977

1977

- Richard Statman
- 18th Annual Symposium on Foundations of Computer…
- 1977

Historically, the principal interest in the typed λ-calculus is in connection with Godel's functional ("Dialectica… (More)

Is this relevant?