96
complexity-theory
× 24 |
23
np
× 4 |
7
pseudo-random-generators
|
4
artificial-intelligence
|
64
research
× 2 |
21
p-vs-np
× 3 |
6
reductions
× 4 |
3
computability
× 2 |
60
education
× 2 |
18
arithmetic
|
5
turing-machines
× 6 |
3
binary-search
× 2 |
59
typing
|
17
computer-architecture
× 2 |
5
formal-languages
× 3 |
3
undecidability
× 2 |
59
programming-languages
|
16
numeral-representations
|
5
optimization
× 2 |
3
bipartite-matching
|
51
quantum-computing
× 7 |
13
np-complete
× 5 |
5
lambda-calculus
|
3
encryption
|
50
algorithms
× 10 |
10
cryptography
× 2 |
5
terminology
|
3
regular-languages
|
42
halting-problem
× 3 |
10
decision-problem
× 2 |
5
sets
|
3
notation
|
38
static-analysis
|
9
asymptotics
× 2 |
5
efficiency
|
3
hash
|
31
complexity-classes
× 7 |
8
neural-networks
× 3 |
5
history
|
3
regular-expressions
|
26
polynomial-time
× 3 |
8
np-hard
× 2 |
4
graphs
× 5 |
3
greedy-algorithms
|
25
algorithm-analysis
× 3 |
8
propositional-logic
× 2 |
4
circuits
× 2 |
3
hashing
|
24
time-complexity
× 5 |
7
random-number-generator
|
4
probabilistic-algorithms
|
3
assignment-problem
|
Lieuwe Vinkhuijzen
