FL (Q5426585)
Jump to navigation
Jump to search
set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | FL |
set of function problems which can be solved by a deterministic Turing machine in a logarithmic amount of memory space |
Statements
Sitelinks
Wikipedia(1 entry)
- enwiki FL (complexity)