isWeaklyNPComplete
P161756
predicate
Indicates that a problem belongs to the class of NP-complete problems whose hardness relies on large numerical parameters, and which may admit pseudo-polynomial-time algorithms.
All labels observed (1)
| Label | Occurrences |
|---|---|
| isWeaklyNPComplete 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: isWeaklyNPComplete
Generated description
Indicates that a problem belongs to the class of NP-complete problems whose hardness relies on large numerical parameters, and which may admit pseudo-polynomial-time algorithms.
Sample triples (1)
| Subject | Object |
|---|---|
| Subset sum problem | true ⓘ |