Software Engineering KB
Search
Search
Dark mode
Light mode
Explorer
Home
❯
01 Foundations
❯
02 Computational Complexity
❯
02 Sub Concept
Folder: 01-Foundations/02-Computational-Complexity/02-Sub-Concept
29 items under this folder.
Feb 10, 2026
3-SAT
computational-complexity
complexity-classes
np-complete
3-sat
Feb 10, 2026
At Least as Hard as NP-Complete
computational-complexity
complexity-classes
np-hard
Feb 10, 2026
Dynamic Array Resizing
computational-complexity
time-complexity
amortized
dynamic-array
Feb 10, 2026
Extra Space Beyond Input
computational-complexity
space-complexity
auxiliary-space
Feb 10, 2026
Graph Coloring
computational-complexity
complexity-classes
np-complete
graph-coloring
Feb 10, 2026
Halting Problem
computational-complexity
complexity-classes
undecidable
halting-problem
Feb 10, 2026
Hash Tables vs Sorted Arrays
computational-complexity
space-complexity
tradeoff
Feb 10, 2026
Higher Complexity Classes
computational-complexity
complexity-classes
pspace
exptime
Feb 10, 2026
Lower Bound
computational-complexity
time-complexity
lower-bound
Feb 10, 2026
Memoization vs Recomputation
computational-complexity
space-complexity
tradeoff
memoization
Feb 10, 2026
O(1) Constant
computational-complexity
time-complexity
constant
Feb 10, 2026
O(1) Extra Space
computational-complexity
space-complexity
in-place
constant-space
Feb 10, 2026
O(2 to the n) Exponential
computational-complexity
time-complexity
exponential
Feb 10, 2026
O(log n) Logarithmic
computational-complexity
time-complexity
logarithmic
Feb 10, 2026
O(n log n) Linearithmic
computational-complexity
time-complexity
linearithmic
Feb 10, 2026
O(n squared) Quadratic
computational-complexity
time-complexity
quadratic
Feb 10, 2026
O(n!) Factorial
computational-complexity
time-complexity
factorial
Feb 10, 2026
O(n) Linear
computational-complexity
time-complexity
linear
Feb 10, 2026
Proving NP-Completeness
computational-complexity
reductions
np-completeness
proof
Feb 10, 2026
Reducing Unknown to Known Problem
computational-complexity
reductions
transformations
Feb 10, 2026
Rice's Theorem
computational-complexity
complexity-classes
undecidable
rices-theorem
Feb 10, 2026
SAT
computational-complexity
complexity-classes
np-complete
sat
Feb 10, 2026
Solvable in Polynomial Time
computational-complexity
complexity-classes
polynomial-time
Feb 10, 2026
The Million-Dollar Open Question
computational-complexity
complexity-classes
p-vs-np
millennium
Feb 10, 2026
Tight Bound
computational-complexity
time-complexity
tight-bound
Feb 10, 2026
Traveling Salesman (Decision)
computational-complexity
complexity-classes
np-complete
tsp
Feb 10, 2026
Upper Bound
computational-complexity
time-complexity
upper-bound
Feb 10, 2026
Verifiable in Polynomial Time
computational-complexity
complexity-classes
verifiable
Feb 10, 2026
Worst Case
computational-complexity
time-complexity
worst-case