User a3nm

12

25

votes

1

answer

712

views

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

Jun 18 '15 at 9:43 Community♦ 1

7

23

votes

1

answer

656

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

6

23

votes

1

answer

551

views

Languages recognized by polynomial-size DFAs

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

Jun 18 '15 at 10:16 a3nm 3,684

4

22

votes

2

answers

487

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 3,684

8

21

votes

4

answers

5k

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 790

2

16

votes

2

answers

1k

views

“Almost sorting” integers in linear time

reference-request time-complexity sorting

Jun 15 at 12:37 David 188

3

16

votes

1

answer

195

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♦ 3,828

4

16

votes

0

answers

285

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 3,684

4

15

votes

2

answers

679

views

Complexity of counting the number of edge covers of a graph

reference-request graph-algorithms counting-complexity proofs

May 17 at 5:39 M.Monet 491

4

15

votes

3

answers

887

views

Complexity of topological sort with constrained positions

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

Sep 19 '13 at 20:43 D.W. 7,601

1

15

votes

4

answers

373

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

450

views

Imperfect subgraph isomorphism

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

Nov 11 '12 at 5:59 Community♦ 1

14

votes

2

answers

333

views

Smallest set not included in a collection of sets

cc.complexity-theory ds.algorithms

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

2

13

votes

0

answers

201

views

Which monotone DNFs are evasive?

np-hardness boolean-functions

Jul 17 at 14:06 a3nm 3,684

1

13

votes

1

answer

224

views

What are bounded-treewidth circuits good for?

circuit-complexity pr.probability treewidth arithmetic-circuits

Oct 29 at 16:40 a3nm 3,684

1

13

votes

2

answers

3k

views

Lexicographically minimal topological sort of a labeled DAG

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

Jul 14 '15 at 1:01 Community♦ 1

12

votes

0

answers

122

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 3,684

1

12

votes

1

answer

331

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

3k

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ε 18.4k

11

votes

2

answers

239

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 3,684

1

11

votes

1

answer

289

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 3,684

1

11

votes

1

answer

635

views

Enumerating topological sorts of a vertex-labeled DAG

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

Mar 4 '17 at 9:52 Community♦ 1

2

11

votes

1

answer

671

views

Identifying useless edges for shortest path

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

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

3

11

votes

2

answers

364

views

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

ds.algorithms

Jul 11 '12 at 12:19 Massimo Cafaro 1,976

1

10

votes

0

answers

120

views

Which convex polytopes have volumes of polynomial bit-length?

reference-request computational-geometry convex-geometry polytope

Aug 20 '16 at 3:56 domotorp 9,242

3

10

votes

1

answer

3k

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

2

10

votes

2

answers

267

views

Smallest Boolean circuit to generate a language

fl.formal-languages circuit-complexity

Oct 21 '13 at 18:19 Andy Drucker 4,094

2

9

votes

0

answers

98

views

Graphs with minimal-size induced subgraphs

reference-request graph-theory extremal-combinatorics

Aug 9 '18 at 8:55 C Komus 604

9

votes

1

answer

201

views

Finding subgraphs with high treewidth and constant degree

co.combinatorics treewidth graph-minor bounded-degree

Aug 29 '17 at 21:53 Kaveh 16.3k

9

votes

1

answer

263

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

53 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?

Languages recognized by polynomial-size DFAs

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

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

“Almost sorting” integers in linear time

Which monotone Boolean functions are representable as thresholds on sums?

Complexity of the homomorphism problem parameterized by treewidth

Complexity of counting the number of edge covers of a graph

Complexity of topological sort with constrained positions

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

Imperfect subgraph isomorphism

Smallest set not included in a collection of sets

Which monotone DNFs are evasive?

What are bounded-treewidth circuits good for?

Lexicographically minimal topological sort of a labeled DAG

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

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

Generalization of Dilworth's theorem for labeled DAGs

Enumerating topological sorts of a vertex-labeled DAG

Identifying useless edges for shortest path

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

Which convex polytopes have volumes of polynomial bit-length?

Monotone bijections between lists of intervals

Smallest Boolean circuit to generate a language

Graphs with minimal-size induced subgraphs

Finding subgraphs with high treewidth and constant degree

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