1
शोधन प्रकार
काम पर मुझे एक गतिशील भाषा के बारे में कुछ प्रकार की जानकारी के साथ काम सौंपा गया है। मैं बयानों के अनुक्रमों को नेस्टेड letअभिव्यक्तियों में फिर से लिखता हूं , जैसे: return x; Z => x var x; Z => let x = undefined in Z x = …
11
programming-languages
logic
type-theory
type-inference
machine-learning
data-mining
clustering
order-theory
reference-request
information-theory
entropy
algorithms
algorithm-analysis
space-complexity
lower-bounds
formal-languages
computability
formal-grammars
context-free
parsing
complexity-theory
time-complexity
terminology
turing-machines
nondeterminism
programming-languages
semantics
operational-semantics
complexity-theory
time-complexity
complexity-theory
reference-request
turing-machines
machine-models
simulation
graphs
probability-theory
data-structures
terminology
distributed-systems
hash-tables
history
terminology
programming-languages
meta-programming
terminology
formal-grammars
compilers
algorithms
search-algorithms
formal-languages
regular-languages
complexity-theory
satisfiability
sat-solvers
factoring
algorithms
randomized-algorithms
streaming-algorithm
in-place
algorithms
numerical-analysis
regular-languages
automata
finite-automata
regular-expressions
algorithms
data-structures
efficiency
coding-theory
algorithms
graph-theory
reference-request
education
books
formal-languages
context-free
proof-techniques
algorithms
graph-theory
greedy-algorithms
matroids
complexity-theory
graph-theory
np-complete
intuition
complexity-theory
np-complete
traveling-salesman
algorithms
graphs
probabilistic-algorithms
weighted-graphs
data-structures
time-complexity
priority-queues
computability
turing-machines
automata
pushdown-automata
algorithms
graphs
binary-trees
algorithms
algorithm-analysis
spanning-trees
terminology
asymptotics
landau-notation
algorithms
graph-theory
network-flow
terminology
computability
undecidability
rice-theorem
algorithms
data-structures
computational-geometry