Theoretical Computer Science Stack Exchange

0

votes

0

answers

21

views

Approximate counting with non-uniform sampler

counting-complexity

asked 4 hours ago Nocturne 101

0

votes

0

answers

41

views

Computational cost of Optimal Morse-Like codes?

information theory prefix free codes

modified 7 hours ago Jeremy 2,341

-2

votes

0

answers

21

views

Machine learning algorithms for classification 8 parts of figure of speech

ds.algorithms machine-learning language-design

modified 10 hours ago Prashant Akerkar 97

0

votes

0

answers

18

views

A clear and rigorous explanation of critical pairs and the Knuth-Bendix completion algorithm?

reference-request term-rewriting-systems first-order-logic

asked 11 hours ago Evan Aad 247

9

votes

1

answer

136

views

The number of clauses in an unsatisfiable CNF

reference-request graph-theory sat

answered yesterday Christian Komusiewicz 1,530

1

vote

1

answer

42

views

Separating DAGs using separators consisting of lists of nodes and all ancestors

ds.algorithms graph-theory graph-algorithms ds.data-structures directed-acyclic-graph

answered yesterday daniello 2,991

0

votes

0

answers

25

views

Expected value in case of Langevin dynamics

pr.probability upper-bounds approximation stochastic-process

asked 2 days ago Dushyant Sahoo 101

-1

votes

0

answers

48

views

Curry Howard Isomorphism and cut elimination

curry-howard

asked 2 days ago David Lehnherr 99

0

votes

0

answers

14

views

Notation for scheduling problems with multiple release times/deadline intervals

reference-request scheduling notation

asked 2 days ago a3nm 6,786

0

votes

0

answers

30

views

3-partition problem without the restriction to triplets

reductions partition-problem

asked 2 days ago Erel Segal-Halevi 1,548

27

votes

5

answers

4k

views

Counting words accepted by a regular grammar

ds.algorithms co.combinatorics fl.formal-languages regular-language

answered Oct 24 at 15:19 joro 1,905

1

vote

0

answers

80

views

$\mathit{FO}[+,\times]$ seems more powerful than $\mathit{DLOGTIME}$-uniform $\mathit{AC}^0$?

lo.logic uniformity ac0

modified Oct 23 at 7:54 Emil Jeřábek 12.1k

1

vote

0

answers

92

views

Functional abbreviation for Inst expression in Turing's 1936 paper

lo.logic computability turing-machines

modified Oct 22 at 21:34 Ajax 111

4

votes

1

answer

242

views

Is this a known learning problem?

machine-learning lg.learning st.statistics pac-learning

answered Oct 22 at 18:53 Aryeh 8,544

Sep	OCT	Nov
	28
2019	2020	2021

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Approximate counting with non-uniform sampler

Computational cost of Optimal Morse-Like codes?

Machine learning algorithms for classification 8 parts of figure of speech

A clear and rigorous explanation of critical pairs and the Knuth-Bendix completion algorithm?

The number of clauses in an unsatisfiable CNF

Separating DAGs using separators consisting of lists of nodes and all ancestors

Expected value in case of Langevin dynamics

Curry Howard Isomorphism and cut elimination

Notation for scheduling problems with multiple release times/deadline intervals

3-partition problem without the restriction to triplets

Counting words accepted by a regular grammar

$\mathit{FO}[+,\times]$ seems more powerful than $\mathit{DLOGTIME}$-uniform $\mathit{AC}^0$?

Functional abbreviation for Inst expression in Turing's 1936 paper

Is this a known learning problem?

Hot Network Questions