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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| complexityClaim canonical | 1 |
Description generation (PDg)
The one-sentence description above was generated by prompting gpt-5.1 with the predicate name and this instruction.
Instruction
Given a predicate that represents a relationship or action between entities, generate a one-sentence description explaining its meaning. # Instructions Focus on describing the relationship, not the entities themselves. # Response Format Begin the description with \' Indicates...\'
Input
Predicate: complexityClaim
Generated description
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) ⓘ |