Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00280328n
Noun Named Entity
Categories: Theoretical computer science stubs, Complexity classes
EN
FL  Log space computable function
EN
In computational complexity theory, the complexity class FL is the set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
In computational complexity theory, the complexity class FL is the set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space. Wikipedia
A class of functions in complexity theory Wikipedia Disambiguation
Set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space Wikidata
IS A
complexity class
PART OF
FP
Wikipedia
EN
FL (complexity)
Wikidata
EN
FL
Wikipedia Redirections
EN
Log space computable function

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