# 次のセクションのタグ: 理論計算機科学

ds.algorithms × 515
graph-theory × 335
lo.logic × 204
np-hardness × 197
soft-question × 191
computability × 117
big-list × 109
type-theory × 107
sat × 95
lower-bounds × 90
cg.comp-geom × 89
big-picture × 83
reductions × 54
optimization × 51
open-problem × 43
lg.learning × 42
np × 40
randomness × 39
sorting × 39
treewidth × 36
matrices × 32
algebra × 30
p-vs-np × 30
context-free × 29
permutations × 28
career × 27
oracles × 27
proofs × 27
semantics × 23
survey × 23
dfa × 22
physics × 22
polynomials × 22
teaching × 22
tree × 22
proof-theory × 21
terminology × 21
np-complete × 20
type-systems × 20
decidability × 19
factoring × 19
pcp × 19
coq × 18
graph-minor × 18
matching × 18
books × 17
puzzles × 16
grammars × 15
random-walks × 15
clique × 14
permanent × 14
software × 14
compilers × 13
complexity × 13
csp × 13
paper-review × 13
set-cover × 13
topology × 13
writing × 13
board-games × 12
concurrency × 12
conferences × 12
expanders × 12
heuristics × 12
linear-logic × 12
logspace × 12
parsing × 12
db.databases × 11
gct × 11
pspace × 11
tsp × 11
upper-bounds × 11
vc-dimension × 11
barriers × 10
hypergraphs × 10
max-cut × 10
order-theory × 10
security × 9
set-theory × 9
clustering × 8
journals × 8
metrics × 8
primes × 8
subset-sum × 7
formulas × 6
intuition × 6
max-flow × 6
monotone × 6
simplex × 6
black-box × 5
embeddings × 5
encoding × 5
examples × 5
lattice × 5
packing × 5
philosophy × 5
recursion × 5
separation × 5
symmetry × 5
worst-case × 5
monoid × 4
nexp × 4
nfa × 4
uniformity × 4
circuits × 3
function × 3
lisp × 3
norms × 3
p-hardness × 3
polygon × 3
polytope × 3
scheduling × 3
ac0 × 2
apx × 2
bounds × 2
card-games × 2
data-sets × 2
extractors × 2
fft × 2
max2sat × 2
notation × 2
qma × 2
recursive × 2
scheme × 2
skip-lists × 2
soundness × 2
speed-up × 2
streaming × 2
succinct × 2
agda × 1
authorship × 1
cook-levin × 1
finite × 1
fractals × 1
fsm × 1
huffman × 1
memory × 1
ocaml × 1