Deductions
- computational complexity has quality abstract entity ⇐ (computational complexity is subclass of quality), (quality has quality abstract entity)
- computational complexity has quality superclass ⇐ (computational complexity is subclass of quality), (quality has quality superclass)
- computational complexity has quality existence ⇐ (computational complexity is subclass of quality), (quality has quality existence)
- computational complexity has quality entity ⇐ (computational complexity is subclass of quality), (quality has quality entity)
- computational complexity has quality taxonomic rank ⇐ (computational complexity is subclass of quality), (quality has quality taxonomic rank)
- computational complexity has quality type ⇐ (computational complexity is subclass of quality), (quality has quality type)
- computational complexity has quality type of property ⇐ (computational complexity is subclass of quality), (quality has quality type of property)
- computational complexity has quality class ⇐ (computational complexity is subclass of quality), (quality has quality class)
- computational complexity is subclass of quality ⇐ (computational complexity is subclass of measure), (measure is subclass of quality), (is subclass of is a transitive relation)
- concept is for example computational complexity ⇐ (computational complexity is a concept), (is a is inverse of is for example)
- preferred rank has quality computational complexity ⇐ (preferred rank has quality algorithm), (algorithm has quality computational complexity), (has quality is a transitive relation)