hasComplexity
P28756
predicate
Indicates that something possesses a certain level or type of complexity, often in terms of structure, behavior, or difficulty.
All labels observed (50)
| Label | Occurrences |
|---|---|
| hasComplexity canonical | 16 |
| hasComplexityProperty | 5 |
| scriptComplexity | 5 |
| hasComplexStructure | 3 |
| hasComplexityGuarantee | 3 |
| hasProgrammingComplexity | 3 |
| implementationComplexity | 3 |
| modelCheckingComplexity | 3 |
| deckComplexity | 2 |
| haveComplexMorphology | 2 |
| missionComplexity | 2 |
| projectComplexity | 2 |
| satisfiabilityComplexity | 2 |
| verificationComplexity | 2 |
| accessComplexity | 1 |
| caseComplexity | 1 |
| collisionComplexity | 1 |
| complexityCharacteristic | 1 |
| complexityDecisionProblem | 1 |
| complexityOf2SAT | 1 |
| complexityOfHornSAT | 1 |
| complexityOfRecognition | 1 |
| complexityRelativeToMNIST | 1 |
| complicated | 1 |
| decisionVersionComplexity | 1 |
| decodingComplexity | 1 |
| elementAccessComplexity | 1 |
| encryptionComplexity | 1 |
| harmonicComplexity | 1 |
| hasComplexityForMatVec | 1 |
| hasHigherSongComplexityThan | 1 |
| hasIntricateComposition | 1 |
| hasStationComplexity | 1 |
| isComplexToPlay | 1 |
| isDynamicallyComplex | 1 |
| mapComplexity | 1 |
| miniMapComplexity | 1 |
| moreComplexThan | 1 |
| mutationComplexity | 1 |
| nestComplexity | 1 |
| operationComplexity | 1 |
| predictionComplexity | 1 |
| preparationComplexity | 1 |
| processingComplexity | 1 |
| rulesComplexity | 1 |
| standardTransformerComplexity | 1 |
| structuralComplexity | 1 |
| syrinxComplexity | 1 |
| trainingComplexity | 1 |
| typicalGameComplexity | 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: hasComplexity
Generated description
Indicates that something possesses a certain level or type of complexity, often in terms of structure, behavior, or difficulty.
Sample triples (89)
| Subject | Object |
|---|---|
| OWL 2 QL | AC0 data complexity for certain query answering tasks ⓘ |
| Arcade (retro-style game platform) | simple games via predicate surface "typicalGameComplexity" ⓘ |
| Council of Pisa | resolution of the Western Schism via predicate surface "complicated" ⓘ |
| Demotic script | highly ligatured and abbreviated via predicate surface "scriptComplexity" ⓘ |
| Merkle tree | O(log n) via predicate surface "verificationComplexity" ⓘ |
| Blum–Micali pseudorandom number generator | polynomial time per output bit ⓘ |
| 125th Street station (Lenox Avenue Line) | local and express operations on three-track line via predicate surface "hasStationComplexity" ⓘ |
| Atayalic languages | true via predicate surface "haveComplexMorphology" ⓘ |
| Conway’s Doomsday algorithm | constant time with respect to date size ⓘ |
| Hunt Construction Group | high via predicate surface "projectComplexity" ⓘ |
| OWL 2 EL | polynomial time for standard reasoning tasks ⓘ |
| Passeri | Suboscines via predicate surface "hasHigherSongComplexityThan" ⓘ |
| NASA Flagship Program | multi-instrument payloads via predicate surface "missionComplexity" ⓘ |
| NASA Flagship Program | complex cruise and operations phases via predicate surface "missionComplexity" ⓘ |
| Suboscines | less complex than oscines via predicate surface "syrinxComplexity" ⓘ |
| The Arrangement | true via predicate surface "hasIntricateComposition" ⓘ |
| MD5 | significantly lower than 2^64 via predicate surface "collisionComplexity" ⓘ |
| Moldanubian Zone | high via predicate surface "structuralComplexity" ⓘ |
| Commercial Calendar Section | complex via predicate surface "caseComplexity" ⓘ |
| Warnock algorithm | adaptive to scene and image complexity via predicate surface "complexityCharacteristic" ⓘ |
|
Kodachrome
linked to:
Kodachrome film
|
high via predicate surface "processingComplexity" ⓘ |
| Contrapunctus XIII | high ⓘ |
| Heun’s method | simple via predicate surface "implementationComplexity" ⓘ |
| Heroes and Villains | true via predicate surface "hasComplexStructure" ⓘ |
| KMNIST | higher via predicate surface "complexityRelativeToMNIST" ⓘ |
| Yoshi Valley | high via predicate surface "miniMapComplexity" ⓘ |
| Pipe Plaza | high via predicate surface "mapComplexity" ⓘ |
|
CTL*
linked to:
branching-time temporal logic CTL*
|
2EXPTIME-complete via predicate surface "satisfiabilityComplexity" ⓘ |
|
CTL*
linked to:
branching-time temporal logic CTL*
|
PSPACE-complete for state formulas via predicate surface "modelCheckingComplexity" ⓘ |
| CTL* | model checking is 2EXPTIME-complete in formula size ⓘ |
| CTL* | model checking is polynomial in model size for fixed formula ⓘ |
| Jurchen script | partially deciphered via predicate surface "scriptComplexity" ⓘ |
| NRZ-L | low via predicate surface "implementationComplexity" ⓘ |
| BidirectionalCollection | O(1) via predicate surface "elementAccessComplexity" ⓘ |
| RandomAccessCollection | O(1) index distance via predicate surface "hasComplexityGuarantee" ⓘ |
| RandomAccessCollection | O(1) index offsetting via predicate surface "hasComplexityGuarantee" ⓘ |
| RandomAccessCollection | O(1) index subscripting via predicate surface "hasComplexityGuarantee" ⓘ |
|
Bidiagonal matrix
linked to:
Bidiagonal
|
O(n) via predicate surface "hasComplexityForMatVec" ⓘ |
| Longformer | O(n) attention complexity with respect to sequence length ⓘ |
| BG&E | complex via predicate surface "projectComplexity" ⓘ |
|
Toeplitz matrix
linked to:
Toeplitz matrices
|
O(n^2) direct solution methods ⓘ |
|
Toeplitz matrix
linked to:
Toeplitz matrices
|
O(n log^2 n) superfast methods (typical) ⓘ |
|
Hamiltonian cycle
linked to:
Hamiltonian cycle concept
|
NP-complete in general graphs via predicate surface "complexityOfRecognition" ⓘ |
| Merkle proof | logarithmic in the number of leaves ⓘ |
| Eulerian trail | decidable in linear time in the size of the graph via predicate surface "complexityDecisionProblem" ⓘ |
| Abell 3526 | yes via predicate surface "isDynamicallyComplex" ⓘ |
| Stella by Starlight | high via predicate surface "harmonicComplexity" ⓘ |
| SAT problem | solvable in polynomial time via predicate surface "complexityOf2SAT" ⓘ |
| SAT problem | solvable in polynomial time via predicate surface "complexityOfHornSAT" ⓘ |
| Max-SAT | NP-complete via predicate surface "decisionVersionComplexity" ⓘ |