problemType
P83422
predicate
Indicates the specific category or classification of a problem within a defined problem space or system.
Observed surface forms (6)
- exampleProblem ×7
- problemTypes ×4
- typeOfProblem ×4
- problemTypeSpecialization ×3
- problemTypeInvolved ×2
- problemTypeStudied ×2
Sample triples (35)
| Subject | Object |
|---|---|
| Canadian Mathematical Olympiad | olympiad-style problems ⓘ |
| Canadian Mathematical Olympiad | proof-based problems ⓘ |
| Cook–Levin theorem | Boolean satisfiability problem via predicate surface "problemTypeInvolved" ⓘ |
| Cook–Levin theorem | SAT via predicate surface "problemTypeInvolved" ⓘ |
| DV-5 | malfunction under specific conditions ⓘ |
| Electron Pump | hard-science speculative technology problem ⓘ |
| Grelling–Nelson paradox | vagueness and self-application in predicates ⓘ |
|
Karp reductions
surface form:
Karp reduction
|
decision problems with yes/no answers ⓘ |
| Masked man paradox | apparent contradiction ⓘ |
| Merkle–Hellman knapsack cryptosystem | NP-complete problem (subset sum) ⓘ |
|
“Molecular computation of solutions to combinatorial problems”
surface form:
Molecular computation of solutions to combinatorial problems
|
combinatorial search problem ⓘ |
| NP-hardness | 3-SAT is NP-hard via predicate surface "exampleProblem" NERFINISHED ⓘ |
| NP-hardness | clique problem (optimization version) is NP-hard via predicate surface "exampleProblem" ⓘ |
| NP-hardness | halting problem (under suitable reductions) via predicate surface "exampleProblem" NERFINISHED ⓘ |
| NP-hardness | satisfiability problem for Boolean formulas (SAT) is NP-hard via predicate surface "exampleProblem" ⓘ |
| NP-hardness | subset sum optimization problem is NP-hard via predicate surface "exampleProblem" ⓘ |
| NP-hardness | traveling salesman problem (optimization version) is NP-hard via predicate surface "exampleProblem" NERFINISHED ⓘ |
| NP-hardness | vertex cover problem (optimization version) is NP-hard via predicate surface "exampleProblem" ⓘ |
| On Divisions of Figures | area partition problems via predicate surface "typeOfProblem" ⓘ |
| On Divisions of Figures | construction problems via predicate surface "typeOfProblem" ⓘ |
| On Divisions of Figures | locus problems via predicate surface "typeOfProblem" ⓘ |
| On Divisions of Figures | ratio problems via predicate surface "typeOfProblem" ⓘ |
| Sorites paradox | problem of drawing precise boundaries ⓘ |
| Sorites paradox | problem of higher-order vagueness ⓘ |
| Syria at International Mathematical Olympiad | algebra via predicate surface "problemTypes" ⓘ |
| Syria at International Mathematical Olympiad | combinatorics via predicate surface "problemTypes" ⓘ |
| Syria at International Mathematical Olympiad | geometry via predicate surface "problemTypes" ⓘ |
| Syria at International Mathematical Olympiad | number theory via predicate surface "problemTypes" ⓘ |
|
"The Complexity of Theorem-Proving Procedures"
surface form:
The Complexity of Theorem-Proving Procedures
|
decision problems in propositional logic via predicate surface "problemTypeStudied" ⓘ |
|
"The Complexity of Theorem-Proving Procedures"
surface form:
The Complexity of Theorem-Proving Procedures
|
theorem-proving procedures for formal systems via predicate surface "problemTypeStudied" ⓘ |
| Valiant–Vazirani theorem | decision problem ⓘ |
|
Winston Wolfe in Pulp Fiction
surface form:
Winston Wolfe
|
crime scene cleanup via predicate surface "problemTypeSpecialization" ⓘ |
|
Winston Wolfe in Pulp Fiction
surface form:
Winston Wolfe
|
criminal emergencies via predicate surface "problemTypeSpecialization" ⓘ |
|
Winston Wolfe in Pulp Fiction
surface form:
Winston Wolfe
|
evidence disposal via predicate surface "problemTypeSpecialization" ⓘ |
|
the paradox of inquiry
surface form:
paradox of inquiry
|
problem about the possibility of acquiring new knowledge ⓘ |