complexityOfkSATForK≥3
P142031
predicate
Indicates the computational complexity classification of the k-SAT decision problem when the clause size k is at least 3.
All labels observed (1)
| Label | Occurrences |
|---|---|
| complexityOfkSATForK≥3 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: complexityOfkSATForK≥3
Generated description
Indicates the computational complexity classification of the k-SAT decision problem when the clause size k is at least 3.
Sample triples (1)
| Subject | Object |
|---|---|
| SAT problem | NP-complete ⓘ |