Rudolf Adamkovič
Personal site
Up:
Personal website
[
Top
]
[
Contents
]
Computer science
Computer science (CS)
Computational problem
Decision problem
Complexity class
P
NP
NP-complete
Generic search
Breadth-first search (BFS)
Depth-first search (DFS)
Graph coloring (COL)
3-coloring (3COL)
Boolean satisfiability problem (SAT)
Conjunctive normal form (CNF)
3-satisfiability (3SAT)
© 2025 Rudolf Adamkovič under
GNU General Public License
version 3.
Made with
Emacs
and secret alien technologies of yesteryear.