Skip to search formSkip to main contentSkip to account menu

RE (complexity)

Known as: Semialgorithm, RE-complete, Co-RE 
In computability theory and computational complexity theory, RE (recursively enumerable) is the class of decision problems for which a 'yes' answer… 
Wikipedia (opens in a new tab)

Related topics

Related topics

25 relations
ALL (complexity)AlgorithmComplexity classComputability theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2022
2022
Ju n 20 05 A semi-algorithm to find elementary first order invariants of rational second order ordinary differential equations
Here we present a method to find elementary first integrals of rational second order ordinary differential equations (SOODEs… 
2014
2014
Are Timed Automata Bad for a Specification Language? Language Inclusion Checking for Timed Automata
Given a timed automaton \(\cal P\) modeling an implementation and a timed automaton \(\cal S\) as a specification, language… 
2014
2014
Determining Liouvillian first integrals for dynamical systems in the plane and an integrability analysis
2012
2012
Accelerating tree-automatic relations
We study the problem of computing the transitive closure of tree-automatic (binary) relations, which are represented by tree… 
2011
2011
Hardware efficiency versus error probability in unreliable computation
For the purpose of mitigating the effect of transient error in unreliable architecture, many authors have proposed redundant… 
2006
2006
State-Identification Problems for Finite-State Transducers
A well-established theory exists for testing finite-state machines, in particular Moore and Mealy machines. A fundamental class… 
1994
1994
Neuroendocrinologie de la reproduction de l'Anguille : de la recherche fondamentale aux problèmes appliqués
Au stade argente (au moment du depart pour la migration de reproduction), les anguilles sont encore sexuellement immatures… 
Review
1985
Review
1985
Harpsichord and lute music in seventeenth-century France : an assessment of the influence of lute on keyboard repertoire
 The view that the lute exercised an important influence on the formation of French harpsichord style in the seventeenth century… 
1983
1983
On the Requirements of Future Expert Systems
Many artificial intelligence applications require the use of expert systems. As expert systems move into new domains, several… 
1982
1982
Trace-like functions on rings with no nilpotent elements
. Let Rbea ring with no nilpotent elements, with extended center C, and let E be the set of idempotents in C. Our first main… 
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)