Tagi dla Teoretyczne informatyka

cc.complexity-theory x 942
reference-request x 464
ds.algorithms x 449
complexity x 411
graph-theory x 295
soft-question x 177
lo.logic x 170
np-hardness x 169
graph-algorithms x 163
complexity-classes x 161
co.combinatorics x 161
circuit-complexity x 127
pl.programming-languages x 115
fl.formal-languages x 114
quantum-computing x 108
big-list x 104
automata-theory x 103
computability x 102
type-theory x 92
sat x 87
ds.data-structures x 84
algebra x 81
big-picture x 77
lower-bounds x 76
cg.comp-geom x 75
approximation-algorithms x 71
lambda-calculus x 68
cr.crypto-security x 68
np x 63
counting-complexity x 60
time-complexity x 58
linear-algebra x 54
graph-isomorphism x 52
turing-machines x 52
randomized-algorithms x 49
reductions x 49
optimization x 47
proofs x 44
machine-learning x 43
randomness x 43
ho.history-overview x 42
open-problem x 41
linear-programming x 41
pr.probability x 40
derandomization x 39
boolean-functions x 39
lg.learning x 39
ct.category-theory x 38
approximation-hardness x 38
functional-programming x 37
treewidth x 36
space-bounded x 36
research-practice x 35
regular-language x 35
gt.game-theory x 34
sorting x 32
advice-request x 31
conditional-results x 31
semantics x 31
it.information-theory x 29
matrices x 29
nt.number-theory x 29
context-free x 29
parameterized-complexity x 28
algebraic-complexity x 28
p-vs-np x 27
career x 26
polynomial-time x 25
permutations x 25
communication-complexity x 25
arithmetic-circuits x 24
matching x 24
dc.distributed-comp x 23
proof-complexity x 23
oracles x 23
quantum-information x 23
application-of-theory x 22
dependent-type x 22
graph-colouring x 22
dc.parallel-comp x 22
teaching x 21
decidability x 21
survey x 21
nondeterminism x 21
dfa x 20
tree x 20
gr.group-theory x 20
relativization x 19
directed-acyclic-graph x 19
terminology x 19
physics x 19
interactive-proofs x 19
planar-graphs x 19
polynomials x 18
regular-expressions x 18
np-complete x 18
books x 17
factoring x 17
topology x 17
coq x 17
pcp x 16
proof-assistants x 16
proof-theory x 16
denotational-semantics x 15
exp-time-algorithms x 15
computing-over-reals x 15
descriptive-complexity x 15
hash-function x 15
type-systems x 15
graph-minor x 15
kolmogorov-complexity x 15
fixed-parameter-tractable x 15
np-intermediate x 14
query-complexity x 14
fourier-analysis x 13
writing x 13
machine-models x 13
puzzles x 13
automated-theorem-proving x 13
universal-computation x 13
random-walks x 13
paper-review x 12
matrix-product x 12
partial-order x 12
set-cover x 12
software x 12
csp x 12
comp-number-theory x 12
permanent x 12
pseudorandom-generators x 12
structural-complexity x 11
tsp x 11
heuristics x 11
average-case-complexity x 11
program-verification x 11
grammars x 11
search-problem x 11
expanders x 11
string-matching x 11
parsing x 11
clique x 11
pseudorandomness x 11
conferences x 10
implementation x 10
polynomial-hierarchy x 10
halting-problem x 10
gct x 10
upper-bounds x 10
na.numerical-analysis x 10
barriers x 10
logspace x 10
spectral-graph-theory x 10
ai.artificial-intel x 10
one-way-function x 10
type-inference x 10
property-testing x 10
typed-lambda-calculus x 10
compilers x 10
coding-theory x 9
finite-model-theory x 9
unique-solution x 9
max-cut x 9
semidefinite-programming x 8