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.

Observed surface forms (11)

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 work ×1
problem in theoretical computer science ×1

Instances (17)

Byzantine Generals Problem
P versus NP problem via concept surface "computational complexity theory problem"
Halting problem via concept surface "undecidable problem"
Ackermann function via concept surface "classical example in theoretical computer science"
Böhm–Jacopini theorem via concept surface "result in computer science"
SAT problem via concept surface "computational problem"
Steiner tree problem via concept surface "NP-hard problem"
Max-SAT via concept surface "computational problem"
Max-3-SAT via concept surface "computational problem"
Max-E3-LIN-2 via concept surface "computational problem"
short integer solution (SIS) problem via concept surface "computational problem"
surface form: short integer solution problem
Post correspondence problem via concept surface "undecidable problem"
SAT via concept surface "computational problem"
3-SAT via concept surface "Boolean satisfiability problem"
Clique problem via concept surface "computational problem"
Subset sum problem via concept surface "computational problem"
Decision Problems in the Theory of Automata via concept surface "computer science work"