User a3nm

12

25

votes

1

answer

705

views

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

Jun 18 '15 at 9:43 Community♦ 1

6

23

votes

1

answer

523

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,460

4

22

votes

2

answers

466

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 at 21:29 a3nm 3,460

6

22

votes

1

answer

599

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

8

21

votes

4

answers

4k

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 675

3

16

votes

1

answer

188

views

Which monotone Boolean functions are representable as thresholds on sums?

reference-request boolean-functions

Sep 1 at 23:41 Bjørn Kjos-Hanssen♦ 3,629

2

16

votes

1

answer

972

views

“Almost sorting” integers in linear time

reference-request time-complexity sorting

May 9 '17 at 9:42 a3nm 3,460

4

16

votes

0

answers

263

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,460

4

15

votes

3

answers

859

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,336

1

15

votes

4

answers

370

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

445

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

332

views

Smallest set not included in a collection of sets

cc.complexity-theory ds.algorithms

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

2

13

votes

1

answer

219

views

What are bounded-treewidth circuits good for?

circuit-complexity pr.probability treewidth arithmetic-circuits

Oct 29 at 16:40 a3nm 3,460

3

13

votes

2

answers

558

views

Complexity of counting the number of edge covers of a graph

reference-request graph-algorithms counting-complexity proofs

Mar 2 '17 at 21:07 a3nm 3,460

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

1

12

votes

1

answer

273

views

Generalization of Dilworth's theorem for labeled DAGs

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

May 9 at 6:24 a3nm 3,460

12

votes

0

answers

118

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,460

1

12

votes

1

answer

325

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

11

votes

2

answers

230

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 at 12:32 a3nm 3,460

1

11

votes

1

answer

571

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

618

views

Identifying useless edges for shortest path

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

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

3

11

votes

2

answers

363

views

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

ds.algorithms

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

10

votes

1

answer

257

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

119

views

Which convex polytopes have volumes of polynomial bit-length?

reference-request computational-geometry convex-geometry polytope

Aug 20 '16 at 3:56 domotorp 8,928

3

10

votes

1

answer

2k

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

254

views

Smallest Boolean circuit to generate a language

fl.formal-languages circuit-complexity

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

2

9

votes

0

answers

98

views

Graphs with minimal-size induced subgraphs

reference-request graph-theory extremal-combinatorics

Aug 9 at 8:55 C Komus 569

1

9

votes

2

answers

1k

views

Complexity of counting matchings in a bipartite graph

counting-complexity matching bipartite-graphs

Jul 14 at 14:40 user3700810 1

9

votes

1

answer

188

views

Finding subgraphs with high treewidth and constant degree

co.combinatorics treewidth graph-minor bounded-degree

Aug 29 '17 at 21:53 Kaveh 16.4k

9

votes

0

answers

114

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

49 Questions

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

Languages recognized by polynomial-size DFAs

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

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

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

Which monotone Boolean functions are representable as thresholds on sums?

“Almost sorting” integers in linear time

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

Smallest set not included in a collection of sets

What are bounded-treewidth circuits good for?

Complexity of counting the number of edge covers of a graph

Lexicographically minimal topological sort of a labeled DAG

Generalization of Dilworth's theorem for labeled DAGs

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|}$

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

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

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

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

Complexity of counting matchings in a bipartite graph

Finding subgraphs with high treewidth and constant degree

Reconstructing labeled poset from linear extensions