Khoa học máy tính lý thuyết
Thẻ
Account
Sign In
Signup
Thẻ cho Khoa học máy tính lý thuyết
cc.complexity-theory
× 1076
reference-request
× 534
ds.algorithms
× 515
graph-theory
× 335
lo.logic
× 204
graph-algorithms
× 199
np-hardness
× 197
complexity-classes
× 191
soft-question
× 191
co.combinatorics
× 184
circuit-complexity
× 141
pl.programming-languages
× 136
fl.formal-languages
× 131
computability
× 117
quantum-computing
× 117
automata-theory
× 115
big-list
× 109
type-theory
× 107
ds.data-structures
× 98
sat
× 95
lower-bounds
× 90
cg.comp-geom
× 89
approximation-algorithms
× 86
big-picture
× 83
cr.crypto-security
× 80
lambda-calculus
× 73
time-complexity
× 71
counting-complexity
× 68
linear-algebra
× 59
randomized-algorithms
× 56
reductions
× 54
turing-machines
× 54
graph-isomorphism
× 52
optimization
× 51
ho.history-overview
× 47
machine-learning
× 47
linear-programming
× 46
approximation-hardness
× 44
boolean-functions
× 44
pr.probability
× 44
ct.category-theory
× 43
open-problem
× 43
functional-programming
× 42
lg.learning
× 42
derandomization
× 40
np
× 40
space-bounded
× 40
randomness
× 39
regular-language
× 39
research-practice
× 39
sorting
× 39
gt.game-theory
× 36
treewidth
× 36
it.information-theory
× 35
communication-complexity
× 33
conditional-results
× 33
nt.number-theory
× 33
parameterized-complexity
× 33
advice-request
× 32
matrices
× 32
algebra
× 30
algebraic-complexity
× 30
p-vs-np
× 30
polynomial-time
× 30
context-free
× 29
permutations
× 28
proof-complexity
× 28
career
× 27
oracles
× 27
proofs
× 27
application-of-theory
× 26
arithmetic-circuits
× 26
nondeterminism
× 26
planar-graphs
× 25
quantum-information
× 25
relativization
× 25
dependent-type
× 24
graph-colouring
× 24
dc.distributed-comp
× 23
dc.parallel-comp
× 23
semantics
× 23
survey
× 23
dfa
× 22
gr.group-theory
× 22
physics
× 22
polynomials
× 22
teaching
× 22
tree
× 22
directed-acyclic-graph
× 21
proof-theory
× 21
regular-expressions
× 21
terminology
× 21
fixed-parameter-tractable
× 20
np-complete
× 20
type-systems
× 20
decidability
× 19
descriptive-complexity
× 19
factoring
× 19
interactive-proofs
× 19
pcp
× 19
coq
× 18
denotational-semantics
× 18
graph-minor
× 18
matching
× 18
books
× 17
kolmogorov-complexity
× 17
proof-assistants
× 17
computing-over-reals
× 16
exp-time-algorithms
× 16
puzzles
× 16
query-complexity
× 16
automated-theorem-proving
× 15
grammars
× 15
hash-function
× 15
program-verification
× 15
random-walks
× 15
spectral-graph-theory
× 15
clique
× 14
fourier-analysis
× 14
machine-models
× 14
matrix-product
× 14
np-intermediate
× 14
permanent
× 14
polynomial-hierarchy
× 14
software
× 14
universal-computation
× 14
compilers
× 13
complexity
× 13
csp
× 13
paper-review
× 13
partial-order
× 13
set-cover
× 13
topology
× 13
writing
× 13
board-games
× 12
coding-theory
× 12
comp-number-theory
× 12
concurrency
× 12
conferences
× 12
expanders
× 12
heuristics
× 12
linear-logic
× 12
logspace
× 12
one-way-function
× 12
parsing
× 12
pseudorandom-generators
× 12
semidefinite-programming
× 12
space-complexity
× 12
string-matching
× 12
structural-complexity
× 12
ai.artificial-intel
× 11
average-case-complexity
× 11
db.databases
× 11
finite-model-theory
× 11
gct
× 11
halting-problem
× 11
na.numerical-analysis
× 11
online-algorithms
× 11
property-testing
× 11
pseudorandomness
× 11
pspace
× 11
search-problem
× 11
space-time-tradeoff
× 11
tsp
× 11
type-inference
× 11
typed-lambda-calculus
× 11
upper-bounds
× 11
vc-dimension
× 11
advice-and-nonuniformity
× 10
barriers
× 10
edit-distance
× 10
hypergraphs
× 10
implementation
× 10
max-cut
× 10
order-theory
× 10
combinatorial-game-theory
× 9
convex-optimization
× 9
decision-trees
× 9
determinant
× 9
graph-classes
× 9
hamiltonian-paths
× 9
model-checking
× 9
parametricity
× 9
security
× 9
set-theory
× 9
unique-solution
× 9
circuit-families
× 8
clustering
× 8
combinatory-logic
× 8
convex-geometry
× 8
data-streams
× 8
domain-theory
× 8
formal-methods
× 8
formal-modeling
× 8
integer-programming
× 8
journals
× 8
markov-chains
× 8
metrics
× 8
ne.neural-evol
× 8
partition-problem
× 8
phase-transition
× 8
primes
× 8
time-hierarchy
× 8
undecidability
× 8
automorphism
× 7
calculus-of-constructions
× 7
computable-analysis
× 7
dynamic-algorithms
× 7
graph-drawing
× 7
haskell
× 7
max-flow-min-cut
× 7
ppad
× 7
primal-dual
× 7
shortest-path
× 7
st.statistics
× 7
subset-sum
× 7
unique-games-conjecture
× 7
algebraic-topology
× 6
boolean-formulas
× 6
chernoff-bound
× 6
circuit-depth
× 6
computational-geometry
× 6
constructive-mathematics
× 6
context-free-languages
× 6
extensionality
× 6
formulas
× 6
greedy-algorithms
× 6
hierarchy-theorems
× 6
integer-lattice
× 6
intuition
× 6
logical-relations
× 6
max-flow
× 6
monad
× 6
monotone
× 6
random-k-sat
× 6
simplex
× 6
string-search
× 6
black-box
× 5
boolean-matrix
× 5
bounded-degree
× 5
church-turing-thesis
× 5
cliquewidth
× 5
dynamic-programming
× 5
embeddings
× 5
encoding
× 5
examples
× 5
high-dimensional-geometry
× 5
homotopy-type-theory
× 5
imperative-programming
× 5
integrality-gap
× 5
lattice
× 5
online-learning
× 5
packing
× 5
philosophy
× 5
process-algebra
× 5
program-analysis
× 5
ramsey-theory
× 5
random-graphs
× 5
recreational
× 5
recursion
× 5
sample-complexity
× 5
separation
× 5
shannon-entropy
× 5
sorting-network
× 5
sparse-matrix
× 5
symmetry
× 5
term-rewriting-systems
× 5
topological-graph-theory
× 5
worst-case
× 5
zero-knowledge
× 5
analysis-of-algorithms
× 4
approximation
× 4
ar.hardware-architecture
× 4
asymptotics
× 4
counter-automata
× 4
hard-instances
× 4
hypercomputation
× 4
logic-programming
× 4
model-theory
× 4
monoid
× 4
natural-computing
× 4
natural-proofs
× 4
nexp
× 4
nfa
× 4
normalization
× 4
operational-semantics
× 4
program-logic
× 4
relational-structures
× 4
sequent-calculus
× 4
smoothed-analysis
× 4
submodularity
× 4
temporal-logic
× 4
uniformity
× 4
algorithmic-lens
× 3
binary-decision-diagrams
× 3
bounded-depth
× 3
ce.computational-finance
× 3
cellular-automata
× 3
circuits
× 3
curry-howard
× 3
delaunay-triangulation
× 3
epsilon-nets
× 3
equivalence
× 3
evolutionary-game-theory
× 3
fault-tolerance
× 3
finite-fields
× 3
formal-systems
× 3
function
× 3
homomorphic-encryption
× 3
independence
× 3
language-design
× 3
linear-equations
× 3
linear-temporal-logic
× 3
lisp
× 3
metric-spaces
× 3
minimization
× 3
modal-logic
× 3
near-neighbors
× 3
norms
× 3
object-oriented
× 3
p-hardness
× 3
polygon
× 3
polymorphism
× 3
polytope
× 3
proof-techniques
× 3
reversible-computing
× 3
scheduling
× 3
social-sciences
× 3
statistical-physics
× 3
sum-of-squares
× 3
synchronization
× 3
transitive-closure
× 3
ac0
× 2
alternation
× 2
applicative
× 2
apx
× 2
bibliography
× 2
binary-trees
× 2
bipartite-graphs
× 2
bounds
× 2
cache-oblivious
× 2
card-games
× 2
cc-complexity-theory
× 2
combinatorics
× 2
convolution
× 2
cryptographic-attack
× 2
cryptojacking
× 2
data-sets
× 2
disjoint-paths
× 2
experimental
× 2
extractors
× 2
extremal-combinatorics
× 2
fft
× 2
fine-grained
× 2
first-order-logic
× 2
genetic-algorithms
× 2
homomorphism
× 2
interaction-nets
× 2
interval-graphs
× 2
k-wise-independence
× 2
limited-independence
× 2
max2sat
× 2
multicommodity-flow
× 2
ni.networking-internet
× 2
notation
× 2
pac-learning
× 2
prefix-free-code
× 2
probabilistic-complexity
× 2
promise-problems
× 2
proof-search
× 2
qma
× 2
quantum-walk
× 2
random-oracles
× 2
recursive
× 2
scheme
× 2
se.software-engineering
× 2
skip-lists
× 2
soundness
× 2
speed-up
× 2
streaming
× 2
streaming-algorithms
× 2
succinct
× 2
tensor-rank
× 2
tradeoff
× 2
two-player-games
× 2
unary-languages
× 2
universal-turing-machines
× 2
agda
× 1
alternating-hierarchy
× 1
amortized-analysis
× 1
arrangements
× 1
authorship
× 1
bioinformatics
× 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
definitions
× 1
feasible-interpolation
× 1
finite
× 1
flow-problems
× 1
fractals
× 1
fsm
× 1
generalizations
× 1
genetic-programming
× 1
huffman
× 1
image-processing
× 1
independent-set
× 1
measure-theory
× 1
mechanism-design
× 1
memory
× 1
monte-carlo
× 1
mu-calculus
× 1
nash-equilibrium
× 1
natural-deduction
× 1
network-modeling
× 1
obfuscation
× 1
ocaml
× 1
padding
× 1
parallel
× 1
parity
× 1
percolation
× 1
pi-calculus
× 1
privacy
× 1
probabilistic-automata
× 1
probabilistic-circuits
× 1
project-topic
× 1
quadratic
× 1
queueing-theory
× 1
range-searching
× 1
resolution
× 1
selection
× 1
stochastic-process
× 1
total-ordering
× 1
transitive-reduction
× 1
voronoi
× 1
Khi sử dụng trang web của chúng tôi, bạn xác nhận rằng bạn đã đọc và hiểu
Chính sách cookie
và
Chính sách bảo mật
của chúng tôi.
Licensed under
cc by-sa 3.0
with attribution required.