Tags für Theoretische Informatik

cc.complexity-theory x 1062
reference-request x 529
ds.algorithms x 511
complexity x 472
graph-theory x 341
graph-algorithms x 198
np-hardness x 191
soft-question x 189
complexity-classes x 188
lo.logic x 188
co.combinatorics x 180
circuit-complexity x 141
pl.programming-languages x 131
fl.formal-languages x 129
quantum-computing x 117
computability x 112
automata-theory x 110
big-list x 108
type-theory x 102
ds.data-structures x 98
sat x 96
algebra x 91
lower-bounds x 88
cg.comp-geom x 87
approximation-algorithms x 85
big-picture x 81
cr.crypto-security x 80
lambda-calculus x 71
time-complexity x 69
counting-complexity x 68
np x 66
optimization x 59
linear-algebra x 58
randomized-algorithms x 55
turing-machines x 54
reductions x 53
graph-isomorphism x 52
proofs x 48
machine-learning x 47
randomness x 47
linear-programming x 45
ho.history-overview x 44
approximation-hardness x 44
ct.category-theory x 43
boolean-functions x 43
functional-programming x 42
open-problem x 42
lg.learning x 42
pr.probability x 42
derandomization x 40
space-bounded x 40
research-practice x 39
sorting x 38
regular-language x 37
treewidth x 36
gt.game-theory x 36
it.information-theory x 34
semantics x 34
conditional-results x 33
parameterized-complexity x 33
communication-complexity x 33
nt.number-theory x 33
advice-request x 32
matrices x 32
algebraic-complexity x 30
polynomial-time x 29
p-vs-np x 29
context-free x 29
matching x 29
permutations x 28
proof-complexity x 28
career x 27
application-of-theory x 26
arithmetic-circuits x 26
oracles x 26
nondeterminism x 25
planar-graphs x 25
quantum-information x 25
relativization x 24
dependent-type x 24
graph-colouring x 24
decidability x 23
survey x 23
dc.distributed-comp x 23
dc.parallel-comp x 23
teaching x 22
dfa x 22
tree x 22
physics x 22
directed-acyclic-graph x 21
terminology x 21
gr.group-theory x 21
regular-expressions x 21
polynomials x 20
np-complete x 20
fixed-parameter-tractable x 20
factoring x 19
pcp x 19
proof-theory x 19
type-systems x 19
interactive-proofs x 19
topology x 18
coq x 18
descriptive-complexity x 18
graph-minor x 18
books x 17
proof-assistants x 17
denotational-semantics x 17
kolmogorov-complexity x 17
exp-time-algorithms x 16
computing-over-reals x 16
query-complexity x 16
puzzles x 15
hash-function x 15
program-verification x 15
random-walks x 15
grammars x 15
spectral-graph-theory x 15
np-intermediate x 14
matrix-product x 14
software x 14
automated-theorem-proving x 14
universal-computation x 14
permanent x 14
clique x 14
paper-review x 13
fourier-analysis x 13
writing x 13
polynomial-hierarchy x 13
machine-models x 13
set-cover x 13
csp x 13
compilers x 13
conferences x 12
structural-complexity x 12
partial-order x 12
heuristics x 12
coding-theory x 12
logspace x 12
board-games x 12
expanders x 12
string-matching x 12
concurrency x 12
comp-number-theory x 12
one-way-function x 12
parsing x 12
space-complexity x 12
pseudorandom-generators x 12
tsp x 11
gct x 11
upper-bounds x 11
na.numerical-analysis x 11
finite-model-theory x 11
semidefinite-programming x 11
average-case-complexity x 11
pspace x 11
search-problem x 11
ai.artificial-intel x 11
linear-logic x 11
online-algorithms x 11
typed-lambda-calculus x 11
pseudorandomness x 11
space-time-tradeoff x 11
db.databases x 11
implementation x 10
halting-problem x 10
vc-dimension x 10
max-cut x 10
barriers x 10
advice-and-nonuniformity x 10
type-inference x 10
hypergraphs x 10
edit-distance x 10
order-theory x 9
property-testing x 9