complexityClaim
P185765
predicate
Indicates that a statement asserts or specifies the computational complexity (e.g., time or space bounds) of an algorithm, problem, or process.
Sample triples (1)
| Subject | Object |
|---|---|
| Reformer: The Efficient Transformer | reduces attention complexity from O(L^2) to approximately O(L log L) ⓘ |