computer science problem
C17349
concept
A computer science problem is a well-defined computational task or question that requires designing algorithms, data structures, or formal methods to determine a solution or prove properties about its solvability or complexity.
All labels observed (12)
| Label | Occurrences |
|---|---|
| computational problem | 8 |
| Boolean satisfiability problem | 2 |
| undecidable problem | 2 |
| NP-complete problem | 1 |
| NP-hard problem | 1 |
| classical example in theoretical computer science | 1 |
| computability theory problem | 1 |
| computational complexity theory problem | 1 |
| computer science problem canonical | 1 |
| computer science work | 1 |
| problem in theoretical computer science | 1 |
| result in computer science | 1 |
Description generation (CDg)
The one-sentence description above was generated by prompting gpt-5.1 with the class name and this instruction.
Instruction
generate a one-sentence description for a given conceptual class. # Response Format Return only the sentence: "Description: [one-sentence description of the conceptional class]"
Input
Class: computer science problem
Generated description
A computer science problem is a well-defined computational task or question that requires designing algorithms, data structures, or formal methods to determine a solution or prove properties about its solvability or complexity.
Instances (17)
| Instance | Via concept surface |
|---|---|
| Byzantine Generals Problem | — |
| P versus NP problem | computational complexity theory problem |
| Halting problem | undecidable problem |
| Ackermann function | classical example in theoretical computer science |
| Böhm–Jacopini theorem | result in computer science |
| SAT problem | computational problem |
| Steiner tree problem | NP-hard problem |
| Max-SAT | computational problem |
| Max-3-SAT | computational problem |
| Max-E3-LIN-2 | computational problem |
|
short integer solution (SIS) problem
surface form:
short integer solution problem
|
computational problem |
| Post correspondence problem | undecidable problem |
| SAT | computational problem |
| 3-SAT | Boolean satisfiability problem |
| Clique problem | computational problem |
| Subset sum problem | computational problem |
| Decision Problems in the Theory of Automata | computer science work |