Skip to search formSkip to main contentSkip to account menu

ELEMENTARY

Known as: Elementary recursive, Elementary recursive function, Elementary recursive functions 
In computational complexity theory, the complexity class ELEMENTARY of elementary recursive functions is the union of the classes The name was coined… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
2-EXPTIMEBounded quantifierComplexity classComputable function

Broader (1)

Computability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Image compression using an edge adapted redundant dictionary and wavelets
2005
2005
Redressing the democratic deficit in treaty law making: (Re-) establishing a role for Parliament
Review
2005
Review
2005
Factor analysis in environmental studies
In our days, factor analysis has become an important statistical instrument of investigation in modern science, being an adequate… 
2004
2004
Wavelength conversion algorithm in an intelligent WDM network
2001
2001
The Power of Portfolios: What Children Can Teach Us About Learning and Assessment
Preface. Introduction. LESSON 1: Children Can Assess Their Own Learning. LESSON 2: Children Learn All the Time. LESSON 3… 
1998
1998
Solving Scheduling Problems by Simulated Annealing
We define a general methodology to deal with a large family of scheduling problems. We consider the case where some of the… 
1994
1994
How to Progress a Database (and Why) I. Logical Foundations
Highly Cited
1990
Highly Cited
1990
A new approach to unsupervised learning in deterministic environments
Highly Cited
1984
Highly Cited
1984
Degree of adjacency or surroundedness
1979
1979
Equality Languages and Fixed Point Languages
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)