firstNPCompleteProblem
P78664
predicate
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| firstNPCompleteProblem canonical | 4 |
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: firstNPCompleteProblem
Generated description
Indicates that the subject is the earliest or original problem proven to be NP-complete within a given context or theory.
Sample triples (4)
| Subject | Object |
|---|---|
| NP-completeness |
Cook–Levin theorem
ⓘ
surface form:
Boolean satisfiability problem
|
| Cook–Levin theorem | Boolean satisfiability problem NERFINISHED ⓘ |
| Cook–Levin theorem | SAT NERFINISHED ⓘ |
| SAT problem | true ⓘ |