Teorik Bilgisayar Bilimi için etiketler

cc.complexity-theory × 955

reference-request × 469

ds.algorithms × 453

graph-theory × 290

lo.logic × 186

soft-question × 180

np-hardness × 172

co.combinatorics × 164

complexity-classes × 164

graph-algorithms × 163

circuit-complexity × 127

pl.programming-languages × 119

fl.formal-languages × 117

quantum-computing × 109

computability × 107

automata-theory × 106

big-list × 105

type-theory × 97

sat × 86

ds.data-structures × 84

big-picture × 79

lower-bounds × 78

cg.comp-geom × 76

approximation-algorithms × 72

lambda-calculus × 71

cr.crypto-security × 68

counting-complexity × 60

time-complexity × 60

linear-algebra × 55

graph-isomorphism × 52

turing-machines × 52

randomized-algorithms × 50

reductions × 49

ho.history-overview × 45

optimization × 44

machine-learning × 43

linear-programming × 42

open-problem × 42

pr.probability × 41

boolean-functions × 40

derandomization × 39

lg.learning × 39

np × 39

approximation-hardness × 38

ct.category-theory × 38

functional-programming × 37

regular-language × 37

randomness × 36

space-bounded × 36

treewidth × 36

research-practice × 35

gt.game-theory × 34

sorting × 33

advice-request × 31

conditional-results × 31

it.information-theory × 31

nt.number-theory × 30

context-free × 29

matrices × 29

algebraic-complexity × 28

p-vs-np × 28

parameterized-complexity × 28

career × 26

algebra × 25

communication-complexity × 25

permutations × 25

polynomial-time × 25

arithmetic-circuits × 24

oracles × 24

proofs × 24

dc.distributed-comp × 23

proof-complexity × 23

quantum-information × 23

application-of-theory × 22

dc.parallel-comp × 22

dependent-type × 22

graph-colouring × 22

nondeterminism × 22

gr.group-theory × 21

survey × 21

teaching × 21

dfa × 20

relativization × 20

semantics × 20

tree × 20

directed-acyclic-graph × 19

interactive-proofs × 19

physics × 19

planar-graphs × 19

polynomials × 19

terminology × 19

np-complete × 18

proof-theory × 18

regular-expressions × 18

books × 17

coq × 17

decidability × 17

factoring × 17

denotational-semantics × 16

descriptive-complexity × 16

pcp × 16

proof-assistants × 16

type-systems × 16

computing-over-reals × 15

exp-time-algorithms × 15

fixed-parameter-tractable × 15

graph-minor × 15

hash-function × 15

kolmogorov-complexity × 15

automated-theorem-proving × 14

fourier-analysis × 14

machine-models × 14

np-intermediate × 14

puzzles × 14

query-complexity × 14

matching × 13

partial-order × 13

random-walks × 13

universal-computation × 13

writing × 13

comp-number-theory × 12

complexity × 12

csp × 12

grammars × 12

matrix-product × 12

paper-review × 12

permanent × 12

pseudorandom-generators × 12

set-cover × 12

software × 12

topology × 12

average-case-complexity × 11

clique × 11

expanders × 11

halting-problem × 11

heuristics × 11

parsing × 11

polynomial-hierarchy × 11

program-verification × 11

property-testing × 11

pseudorandomness × 11

search-problem × 11

string-matching × 11

structural-complexity × 11

tsp × 11

type-inference × 11

ai.artificial-intel × 10

barriers × 10

compilers × 10

conferences × 10

gct × 10

implementation × 10

logspace × 10

na.numerical-analysis × 10

one-way-function × 10

spectral-graph-theory × 10

typed-lambda-calculus × 10

upper-bounds × 10

advice-and-nonuniformity × 9

board-games × 9

coding-theory × 9

db.databases × 9

decision-trees × 9

determinant × 9

finite-model-theory × 9

hypergraphs × 9

linear-logic × 9

max-cut × 9

online-algorithms × 9

order-theory × 9

semidefinite-programming × 9

space-time-tradeoff × 9

unique-solution × 9

circuit-families × 8

concurrency × 8

domain-theory × 8

edit-distance × 8

graph-classes × 8

markov-chains × 8

metrics × 8

ne.neural-evol × 8

phase-transition × 8

primes × 8

pspace × 8

set-theory × 8

space-complexity × 8

undecidability × 8

automorphism × 7

calculus-of-constructions × 7

clustering × 7

combinatorial-game-theory × 7

combinatory-logic × 7

computable-analysis × 7

convex-geometry × 7

data-streams × 7

formal-methods × 7

formal-modeling × 7

hamiltonian-paths × 7

integer-programming × 7

journals × 7

model-checking × 7

parametricity × 7

primal-dual × 7

security × 7

time-hierarchy × 7

vc-dimension × 7

algebraic-topology × 6

chernoff-bound × 6

computational-geometry × 6

extensionality × 6

formulas × 6

graph-drawing × 6

greedy-algorithms × 6

intuition × 6

monotone × 6

ppad × 6

random-k-sat × 6

shortest-path × 6

unique-games-conjecture × 6

black-box × 5

boolean-formulas × 5

bounded-degree × 5

circuit-depth × 5

cliquewidth × 5

constructive-mathematics × 5

dynamic-algorithms × 5

examples × 5

haskell × 5

hierarchy-theorems × 5

homotopy-type-theory × 5

imperative-programming × 5

integer-lattice × 5

logical-relations × 5

max-flow-min-cut × 5

online-learning × 5

sample-complexity × 5

simplex × 5

sorting-network × 5

string-search × 5

subset-sum × 5

symmetry × 5

topological-graph-theory × 5

worst-case × 5

analysis-of-algorithms × 4

approximation × 4

ar.hardware-architecture × 4

asymptotics × 4

boolean-matrix × 4

church-turing-thesis × 4

context-free-languages × 4

convex-optimization × 4

dynamic-programming × 4

embeddings × 4

encoding × 4

hard-instances × 4

high-dimensional-geometry × 4

integrality-gap × 4

lattice × 4

max-flow × 4

monad × 4

monoid × 4

natural-computing × 4

natural-proofs × 4

nexp × 4

normalization × 4

operational-semantics × 4

packing × 4

partition-problem × 4

process-algebra × 4

program-analysis × 4

ramsey-theory × 4

random-graphs × 4

recreational × 4

recursion × 4

relational-structures × 4

shannon-entropy × 4

smoothed-analysis × 4

sparse-matrix × 4

st.statistics × 4

temporal-logic × 4

term-rewriting-systems × 4

uniformity × 4

zero-knowledge × 4

algorithmic-lens × 3

bounded-depth × 3

ce.computational-finance × 3

circuits × 3

counter-automata × 3

equivalence × 3

evolutionary-game-theory × 3

fault-tolerance × 3

finite-fields × 3

formal-systems × 3

function × 3

homomorphic-encryption × 3

hypercomputation × 3

independence × 3

language-design × 3

linear-equations × 3

lisp × 3

metric-spaces × 3

minimization × 3

norms × 3

object-oriented × 3

p-hardness × 3

philosophy × 3

polygon × 3

polymorphism × 3

program-logic × 3

separation × 3

sequent-calculus × 3

social-sciences × 3

statistical-physics × 3

submodularity × 3

sum-of-squares × 3

transitive-closure × 3

ac0 × 2

alternation × 2

applicative × 2

binary-decision-diagrams × 2

bounds × 2

cache-oblivious × 2

card-games × 2

cc-complexity-theory × 2

cellular-automata × 2

combinatorics × 2

convolution × 2

cryptographic-attack × 2

cryptojacking × 2

curry-howard × 2

data-sets × 2

delaunay-triangulation × 2

disjoint-paths × 2

epsilon-nets × 2

experimental × 2

extractors × 2

fft × 2

fine-grained × 2

first-order-logic × 2

genetic-algorithms × 2

homomorphism × 2

interaction-nets × 2

linear-temporal-logic × 2

logic-programming × 2

modal-logic × 2

model-theory × 2

near-neighbors × 2

nfa × 2

notation × 2

polytope × 2

probabilistic-complexity × 2

proof-search × 2

proof-techniques × 2

quantum-walk × 2

random-oracles × 2

reversible-computing × 2

scheduling × 2

scheme × 2

se.software-engineering × 2

soundness × 2

speed-up × 2

streaming × 2

succinct × 2

synchronization × 2

tensor-rank × 2

tradeoff × 2

two-player-games × 2

unary-languages × 2

universal-turing-machines × 2

alternating-hierarchy × 1

amortized-analysis × 1

apx × 1

arrangements × 1

authorship × 1

bibliography × 1

binary-trees × 1

bioinformatics × 1

bipartite-graphs × 1

charles-babbage × 1

comonad × 1

complexity-assumptions × 1

compressed-sensing × 1

computational-mathematics × 1

continuations × 1

cook-levin × 1

covering-problems × 1

cps-transforms × 1

cv.computer-vision × 1

data-mining × 1

feasible-interpolation × 1

finite × 1

flow-problems × 1

fractals × 1

fsm × 1

generalizations × 1

genetic-programming × 1

image-processing × 1

interval-graphs × 1

k-wise-independence × 1

max2sat × 1

measure-theory × 1

mechanism-design × 1

memory × 1

monte-carlo × 1

mu-calculus × 1

multicommodity-flow × 1

nash-equilibrium × 1

network-modeling × 1

ni.networking-internet × 1

obfuscation × 1

ocaml × 1

pac-learning × 1

padding × 1

parallel × 1

parity × 1

pi-calculus × 1

prefix-free-code × 1

privacy × 1

probabilistic-automata × 1

probabilistic-circuits × 1

project-topic × 1

promise-problems × 1

qma × 1

queueing-theory × 1

range-searching × 1

recursive × 1

resolution × 1

selection × 1

skip-lists × 1

stochastic-process × 1

streaming-algorithms × 1

total-ordering × 1