41
algorithms
× 13 |
5
one-way-functions
× 2 |
4
spanning-trees
|
2
pumping-lemma
× 2 |
19
complexity-theory
× 7 |
5
context-free
× 2 |
3
sorting
× 2 |
2
correctness-proof
|
13
optimization
× 3 |
5
formal-grammars
× 2 |
3
memory-hardware
|
2
object-oriented
|
12
p-vs-np
× 3 |
5
asymptotics
|
3
mathematical-analysis
|
2
strings
|
11
computability
× 2 |
5
landau-notation
|
3
halting-problem
|
2
search-algorithms
|
10
graphs
× 5 |
4
concurrency
× 2 |
3
threads
|
2
reference-request
|
10
dynamic-programming
× 2 |
4
discrete-mathematics
× 2 |
3
computer-algebra
|
2
string-metrics
|
10
combinatorics
× 2 |
4
shortest-path
× 2 |
2
heaps
× 2 |
2
programming-languages
|
8
knapsack-problems
|
4
np-complete
× 2 |
2
np-hard
× 2 |
1
deadlocks
× 2 |
7
time-complexity
× 3 |
4
greedy-algorithms
|
2
data-structures
× 2 |
1
terminology
|
7
genetic-algorithms
|
4
normal-forms
|
2
binary-trees
× 2 |
1
ambiguity
|
6
cryptography
× 2 |
4
quantum-computing
|
2
reductions
× 2 |
1
information-theory
|
5
computer-architecture
× 2 |
4
coin-change
|
2
regular-languages
× 2 |
1
turing-machines
|
lPlant
