231
cc.complexity-theory
× 26 |
21
np-hardness
|
10
graph-algorithms
|
6
turing-machines
|
127
complexity-classes
× 12 |
19
phase-transition
|
10
fixed-parameter-tractable
|
6
functional-programming
|
72
sat
× 10 |
16
heuristics
|
9
type-theory
|
6
fl.formal-languages
|
57
lo.logic
× 10 |
15
lambda-calculus
× 2 |
8
relativization
|
5
logspace
|
55
reference-request
× 13 |
15
monotone
|
8
oracles
|
5
sequent-calculus
|
40
circuit-complexity
× 4 |
15
polynomial-time
|
8
np
|
4
polynomials
|
39
computability
× 4 |
14
p-vs-np
|
8
terminology
|
2
conferences
|
29
ho.history-overview
× 2 |
12
graph-theory
× 2 |
8
pl.programming-languages
|
0
parameterized-complexity
× 2 |
24
proof-complexity
× 9 |
12
analysis-of-algorithms
|
7
puzzles
|
0
boolean-functions
|
24
big-list
× 6 |
11
structural-complexity
|
7
space-bounded
|
0
resolution
|
23
random-k-sat
× 2 |
10
soft-question
× 3 |
7
np-complete
|
|
21
ds.algorithms
× 2 |
10
descriptive-complexity
× 2 |
6
reductions
|
Jan Johannsen
