30
algorithms
× 7 |
7
proof-techniques
|
2
lexical-analysis
|
0
discrete-mathematics
|
15
greedy-algorithms
|
4
formal-grammars
|
2
parsers
|
0
hamiltonian-path
|
15
combinatorics
|
4
turing-machines
|
1
number-theory
× 2 |
0
np-hard
|
9
search-algorithms
× 2 |
4
search-problem
|
1
online-algorithms
× 2 |
0
topology
|
9
natural-language-processing
× 2 |
4
rice-theorem
|
1
base-conversion
× 2 |
0
sorting
|
9
strings
× 2 |
4
formal-languages
|
0
reference-request
× 2 |
0
cryptography
|
8
operating-systems
|
4
selection-problem
|
0
graphs
|
0
satisfiability
|
8
programming-languages
|
4
undecidability
|
0
protocols
|
|
7
loop-invariants
|
2
time-complexity
|
0
np-complete
|
|
7
correctness-proof
|
2
compilers
|
0
complexity-theory
|
Mark Dominus
