Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:02458196n
Noun Named Entity
EL
No term available
EN
In computability theory and computational complexity theory, RE is the class of decision problems for which a 'yes' answer can be verified by a Turing machine in a finite amount of time. Wikipedia
English:
complexity
Relations
Sources
IS A
κλάση πολυπλοκότητας
υπολογιστικό πρόβλημα
HAS PART
EN
R
EN
RE-complete
PART OF
EN
ALL

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License