User a3nm

12

25

votes

1

answer

757

views

Recognizing sequences with all permutations of $\{1, \ldots, n\}$ as subsequences

Jun 18 '15 at 9:43 Community♦ 1

8

24

votes

1

answer

788

views

Is it still open to determine the complexity of computing the treewidth of planar graphs?

reference-request graph-theory np-hardness open-problem treewidth

Sep 11 '15 at 22:31 Community♦ 1

4

23

votes

2

answers

527

views

Testing whether letters can be scheduled to achieve a word in a regular language

cc.complexity-theory np-hardness automata-theory regular-language scheduling

Mar 4 '18 at 21:29 a3nm 6,946

8

23

votes

1

answer

687

views

Languages recognized by polynomial-size DFAs

reference-request fl.formal-languages automata-theory online-algorithms dfa

Jun 18 '15 at 10:16 a3nm 6,946

9

21

votes

4

answers

6k

views

Proof of the pumping lemma for context-free languages using pushdown automata

fl.formal-languages automata-theory proofs grammars

Jan 20 '18 at 13:55 Lamine 1,054

2

17

votes

2

answers

2k

views

“Almost sorting” integers in linear time

reference-request time-complexity sorting

Jun 15 '19 at 12:37 David 188

4

16

votes

2

answers

832

views

Complexity of counting the number of edge covers of a graph

reference-request graph-algorithms counting-complexity proofs

Aug 28 '19 at 11:54 a3nm 6,946

3

16

votes

1

answer

241

views

Which monotone Boolean functions are representable as thresholds on sums?

reference-request boolean-functions

Sep 1 '18 at 23:41 Bjørn Kjos-Hanssen♦ 4,308

4

16

votes

0

answers

315

views

Complexity of the homomorphism problem parameterized by treewidth

graph-algorithms parameterized-complexity treewidth fixed-parameter-tractable homomorphism

Jun 2 '16 at 10:37 a3nm 6,946

4

15

votes

3

answers

970

views

Complexity of topological sort with constrained positions

sorting directed-acyclic-graph partial-order order-theory topological-sorting

May 15 at 15:49 a3nm 6,946

1

15

votes

4

answers

403

views

Worst number of questions needed to learn a monotonic predicate over a poset

ds.algorithms lg.learning partial-order search-problem order-theory

Feb 7 '13 at 12:01 Community♦ 1

4

15

votes

1

answer

478

views

Imperfect subgraph isomorphism

cc.complexity-theory ds.algorithms graph-theory approximation-algorithms graph-isomorphism

Nov 11 '12 at 5:59 Community♦ 1

2

14

votes

1

answer

264

views

What are bounded-treewidth circuits good for?

circuit-complexity pr.probability treewidth arithmetic-circuits

Oct 29 '18 at 16:40 a3nm 6,946

14

votes

2

answers

353

views

Smallest set not included in a collection of sets

cc.complexity-theory ds.algorithms

Dec 20 '12 at 15:53 Yury 3,721

1

13

votes

2

answers

3k

views

Lexicographically minimal topological sort of a labeled DAG

cc.complexity-theory np-hardness directed-acyclic-graph order-theory topological-sorting

May 15 at 15:50 a3nm 6,946

2

13

votes

0

answers

227

views

Which monotone DNFs are evasive?

np-hardness boolean-functions

Jul 17 '19 at 14:06 a3nm 6,946

2

12

votes

0

answers

162

views

Regular languages accepted by an automaton with at most one transition per letter

reference-request fl.formal-languages automata-theory regular-language

Nov 2 at 10:45 a3nm 6,946

12

votes

0

answers

145

views

Is it #P-hard to compute the number of antichains of a distributive lattice?

reference-request counting-complexity partial-order lattice

Nov 11 '15 at 19:28 a3nm 6,946

1

12

votes

1

answer

373

views

Minimal elements of a monotonic predicate over the powerset $2^{|n|}$

ds.algorithms ds.data-structures partial-order order-theory search-problem

Feb 7 '13 at 9:31 Community♦ 1

3

12

votes

2

answers

4k

views

Space complexity to compute the optimal string alignment for the Levenshtein edit distance

cc.complexity-theory dynamic-algorithms edit-distance space-time-tradeoff

Sep 1 '12 at 15:08 Jeffε 22.5k

1

11

votes

1

answer

782

views

Enumerating topological sorts of a vertex-labeled DAG

cc.complexity-theory sorting directed-acyclic-graph partial-order topological-sorting

May 15 at 15:50 a3nm 6,946

11

votes

2

answers

268

views

Determining what can be achieved by a permutation of elements of a noncommutative group

np-hardness sorting gr.group-theory partial-order order-theory

May 11 '18 at 12:32 a3nm 6,946

1

11

votes

1

answer

357

views

Generalization of Dilworth's theorem for labeled DAGs

reference-request graph-theory directed-acyclic-graph partial-order

May 9 '18 at 6:24 a3nm 6,946

2

11

votes

1

answer

922

views

Identifying useless edges for shortest path

ds.algorithms reference-request graph-algorithms shortest-path

Jun 23 '14 at 22:37 JimN 1,227

3

11

votes

2

answers

385

views

Find items that are in at least $k$ of $n$ sets

ds.algorithms

Jul 11 '12 at 12:19 Massimo Cafaro 2,166

2

10

votes

0

answers

102

views

Graphs with minimal-size induced subgraphs

reference-request graph-theory extremal-combinatorics

Aug 9 '18 at 8:55 Christian Komusiewicz 1,657

10

votes

1

answer

297

views

Complexity of checking if two words have an interleaving in a language

cc.complexity-theory reference-request regular-language

Apr 3 '17 at 17:18 Community♦ 1

1

10

votes

0

answers

137

views

Which convex polytopes have volumes of polynomial bit-length?

reference-request computational-geometry convex-geometry polytope

Aug 20 '16 at 3:56 domotorp 13.2k

10

votes

0

answers

125

views

Reconstructing labeled poset from linear extensions

cc.complexity-theory ds.algorithms np-hardness partial-order order-theory

May 21 '15 at 17:31 Community♦ 1

3

10

votes

1

answer

4k

views

Monotone bijections between lists of intervals

cc.complexity-theory ds.algorithms np-hardness partial-order matching

Jul 8 '14 at 16:11 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

58 Questions

Recognizing sequences with all permutations of $\{1, \ldots, n\}$ as subsequences

Is it still open to determine the complexity of computing the treewidth of planar graphs?

Testing whether letters can be scheduled to achieve a word in a regular language

Languages recognized by polynomial-size DFAs

Proof of the pumping lemma for context-free languages using pushdown automata

“Almost sorting” integers in linear time

Complexity of counting the number of edge covers of a graph

Which monotone Boolean functions are representable as thresholds on sums?

Complexity of the homomorphism problem parameterized by treewidth

Complexity of topological sort with constrained positions

Worst number of questions needed to learn a monotonic predicate over a poset

Imperfect subgraph isomorphism

What are bounded-treewidth circuits good for?

Smallest set not included in a collection of sets

Lexicographically minimal topological sort of a labeled DAG

Which monotone DNFs are evasive?

Regular languages accepted by an automaton with at most one transition per letter

Is it #P-hard to compute the number of antichains of a distributive lattice?

Minimal elements of a monotonic predicate over the powerset $2^{|n|}$

Space complexity to compute the optimal string alignment for the Levenshtein edit distance

Enumerating topological sorts of a vertex-labeled DAG

Determining what can be achieved by a permutation of elements of a noncommutative group

Generalization of Dilworth's theorem for labeled DAGs

Identifying useless edges for shortest path

Find items that are in at least $k$ of $n$ sets

Graphs with minimal-size induced subgraphs

Complexity of checking if two words have an interleaving in a language

Which convex polytopes have volumes of polynomial bit-length?

Reconstructing labeled poset from linear extensions

Monotone bijections between lists of intervals