User a3nm

31

votes

5

answers

1k

views

what is easy for minor-excluded graphs?

Jan 4 '19 at 10:32 Community♦ 1

30

votes

5

answers

3k

views

Binary search generalizations for posets?

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

Dec 26 '12 at 17:50 Community♦ 1

29

votes

2

answers

1k

views

Commonest Subsequence

ds.algorithms string-search

Aug 29 '12 at 7:22 domotorp 13.2k

28

votes

2

answers

2k

views

How many DFAs accept two given strings?

cc.complexity-theory fl.formal-languages automata-theory counting-complexity

Dec 16 '11 at 19:48 Community♦ 1

28

votes

0

answers

653

views

The complexity of checking whether two DAG have the same number of topological sorts

cc.complexity-theory complexity-classes counting-complexity open-problem partial-order

Aug 15 '15 at 4:42 Community♦ 1

24

votes

1

answer

845

views

What is the complexity of this covering problem?

cc.complexity-theory ds.algorithms reference-request

Aug 27 '12 at 9:53 Community♦ 1

23

votes

3

answers

724

views

Convex Body with minimum expected l2 norm

cg.comp-geom approximation convex-geometry

Dec 6 '12 at 9:03 Community♦ 1

23

votes

2

answers

559

views

Relation between hardness of recognition of a graph class and forbidden subgraph characterization

cc.complexity-theory graph-theory np-hardness

Jul 25 '11 at 21:33 Community♦ 1

22

votes

2

answers

2k

views

Detecting two kinds of almost-simple polygons

ds.algorithms cg.comp-geom polygon

Sep 13 '12 at 21:04 Jeffε 22.6k

18

votes

0

answers

394

views

Perfect matching of monotone Boolean function with null Euler characteristic

boolean-functions matching monotone

May 26 '19 at 16:56 Lieuwe Vinkhuijzen 1,522

16

votes

1

answer

441

views

What is the complexity of this graph problem?

graph-theory graph-algorithms np-hardness

Feb 21 '18 at 14:44 Marzio De Biasi 21.7k

15

votes

0

answers

582

views

Is it NP-hard to find (the root of) a small decision tree for a monotone boolean function?

graph-theory boolean-functions

Jan 29 '17 at 10:33 Radu GRIGore 4,606

15

votes

1

answer

346

views

Separating words with random DFAs

dfa random-graphs

Dec 26 '15 at 20:55 Community♦ 1

12

votes

0

answers

256

views

Hardness of optimal sorting

ds.algorithms lower-bounds sorting

Feb 19 '14 at 9:43 Joseph Stack 1,085

10

votes

0

answers

544

views

Simple path on dag with backward edges

graph-algorithms time-complexity disjoint-paths

Aug 17 '15 at 20:47 Community♦ 1

10

votes

0

answers

235

views

Complexity of the min edge-colored cut problem

ds.algorithms reference-request graph-algorithms open-problem

Jan 13 '12 at 13:00 Tsuyoshi Ito 16.1k

10

votes

1

answer

353

views

What class of languages is recognized by finite-state automata with $k$ heads?

fl.formal-languages automata-theory regular-language nfa

Oct 6 '19 at 20:59 Community♦ 1

9

votes

1

answer

156

views

Tree decompositions of optimal width where every vertex is in a bounded number of bags?

graph-theory treewidth

Jun 4 at 21:20 hdur 151

9

votes

1

answer

607

views

Minimum spanning tree over all vertex matchings

graph-theory optimization

Jan 11 '13 at 6:20 András Salamon 18.4k

9

votes

1

answer

2k

views

What's the expected length of the shortest hamiltonian path on a randomly selected points from a planar grid?

graph-theory co.combinatorics planar-graphs hamiltonian-paths

Oct 17 '12 at 17:50 Community♦ 1

9

votes

0

answers

121

views

Computing weighted sums of binomial coefficients

ds.algorithms co.combinatorics

Jan 12 '14 at 12:11 Community♦ 1

9

votes

1

answer

363

views

“Verifiable information”: is this a known concept?

cc.complexity-theory reference-request

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

9

votes

1

answer

307

views

Transition monoid membership for DFAs

automata-theory regular-language monoid

May 18 '17 at 0:12 D.W. 9,606

8

votes

0

answers

109

views

Computing the most likely winner in elections : intermediate case between Kemeny and Borda?

ds.algorithms reference-request optimization

Aug 7 '14 at 15:57 Joseph Stack 1,085

8

votes

0

answers

256

views

Existence of “colouring matrices” — a generalisation

co.combinatorics lower-bounds dc.distributed-comp

Jun 6 '12 at 7:33 Community♦ 1

8

votes

2

answers

790

views

Finding a subset of a set in a collection of sets

ds.data-structures

Jul 26 '11 at 19:04 chazisop 3,661

8

votes

3

answers

376

views

Find the nearest $d+1$ corners of a cube in $\mathbb{R}^d$

ds.algorithms approximation-algorithms heuristics

Dec 28 '12 at 12:04 Denis 325

8

votes

4

answers

531

views

Constraints on sliding windows

automata-theory complexity streaming-algorithms sliding-window

May 6 at 8:15 Louis 360

7

votes

1

answer

210

views

Holant problems and holographic reduction: simple graphs or multigraphs?

counting-complexity

Aug 28 '19 at 11:55 a3nm 6,926

7

votes

0

answers

96

views

Deciding whether DCFG is visibly pushdown

fl.formal-languages automata-theory context-free

Jan 2 at 20:34 Hermann Gruber 5,039

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

54 Bookmarks

what is easy for minor-excluded graphs?

Binary search generalizations for posets?

Commonest Subsequence

How many DFAs accept two given strings?

The complexity of checking whether two DAG have the same number of topological sorts

What is the complexity of this covering problem?

Convex Body with minimum expected l2 norm

Relation between hardness of recognition of a graph class and forbidden subgraph characterization

Detecting two kinds of almost-simple polygons

Perfect matching of monotone Boolean function with null Euler characteristic

What is the complexity of this graph problem?

Is it NP-hard to find (the root of) a small decision tree for a monotone boolean function?

Separating words with random DFAs

Hardness of optimal sorting

Simple path on dag with backward edges

Complexity of the min edge-colored cut problem

What class of languages is recognized by finite-state automata with $k$ heads?

Tree decompositions of optimal width where every vertex is in a bounded number of bags?

Minimum spanning tree over all vertex matchings

What's the expected length of the shortest hamiltonian path on a randomly selected points from a planar grid?

Computing weighted sums of binomial coefficients

“Verifiable information”: is this a known concept?

Transition monoid membership for DFAs

Computing the most likely winner in elections : intermediate case between Kemeny and Borda?

Existence of “colouring matrices” — a generalisation

Finding a subset of a set in a collection of sets

Find the nearest $d+1$ corners of a cube in $\mathbb{R}^d$

Constraints on sliding windows

Holant problems and holographic reduction: simple graphs or multigraphs?

Deciding whether DCFG is visibly pushdown