User a3nm

50 votes

0 answers

2k views

Monotone complexity of s-t connectivity

Stasys

6,635

asked Oct 6, 2012 at 12:45

31 votes

5 answers

1k views

what is easy for minor-excluded graphs?

ds.algorithms graph-theory graph-minor

Yaroslav Bulatov

4,631

asked Oct 22, 2010 at 17:45

30 votes

0 answers

744 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

Mike Chen

709

asked Nov 17, 2010 at 22:21

30 votes

2 answers

1k views

Commonest Subsequence

ds.algorithms string-search

daveagp

1,100

asked Aug 14, 2012 at 23:35

30 votes

5 answers

3k views

Binary search generalizations for posets?

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

jkff

8,651

asked Nov 11, 2011 at 4:39

29 votes

2 answers

2k views

How many DFAs accept two given strings?

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

Aryeh

10.1k

asked Jul 26, 2011 at 14:16

24 votes

2 answers

568 views

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

cc.complexity-theory graph-theory np-hardness

Vinicius dos Santos

1,733

asked Jul 2, 2011 at 0:06

24 votes

1 answer

862 views

What is the complexity of this covering problem?

cc.complexity-theory ds.algorithms reference-request

Florent Foucaud

2,103

asked May 31, 2012 at 14:00

23 votes

3 answers

727 views

Convex Body with minimum expected l2 norm

cg.comp-geom approximation convex-geometry

Ashwinkumar B V

1,564

asked Jan 6, 2012 at 4:26

22 votes

2 answers

2k views

Detecting two kinds of almost-simple polygons

ds.algorithms cg.comp-geom polygon

Jeffε

22.8k

asked May 22, 2012 at 14:33

20 votes

5 answers

2k views

A special class of languages: “circular” languages. Is it known?

fl.formal-languages automata-theory regular-language

vincenzoml

363

asked Jan 11, 2011 at 15:12

18 votes

0 answers

474 views

Perfect matching of monotone Boolean function with null Euler characteristic

boolean-functions matching monotone

M.Monet

1,197

asked Apr 1, 2019 at 22:13

18 votes

2 answers

470 views

Separating words with random DFAs

dfa random-graphs

Geoffrey Irving

3,221

asked May 12, 2014 at 0:33

17 votes

1 answer

453 views

What is the complexity of this graph problem?

graph-theory graph-algorithms np-hardness

Andras Farago

10.8k

asked Feb 19, 2018 at 20:52

15 votes

0 answers

620 views

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

graph-theory boolean-functions

Radu GRIGore

4,746

asked Jun 8, 2016 at 22:16

14 votes

0 answers

294 views

Is this problem on unambiguous finite automata NP-complete?

automata-theory np-complete

M.Monet

1,197

asked Apr 20, 2021 at 18:52

12 votes

0 answers

279 views

Hardness of optimal sorting

ds.algorithms lower-bounds sorting

Joseph Stack

1,085

asked Feb 19, 2014 at 9:43

10 votes

0 answers

595 views

Simple path on dag with backward edges

graph-algorithms time-complexity disjoint-paths

Joseph Stack

1,085

asked Apr 16, 2015 at 12:45

10 votes

0 answers

244 views

Complexity of the min edge-colored cut problem

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

richard

101

asked Jan 12, 2012 at 16:02

10 votes

1 answer

682 views

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

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

6005

842

asked Oct 4, 2019 at 15:50

10 votes

1 answer

184 views

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

graph-theory treewidth

hdur

161

asked May 20, 2020 at 10:35

9 votes

1 answer

611 views

Minimum spanning tree over all vertex matchings

graph-theory optimization

M.B.

313

asked Jan 8, 2013 at 15:43

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

Javad

251

asked Oct 8, 2012 at 5:02

9 votes

0 answers

122 views

Computing weighted sums of binomial coefficients

ds.algorithms co.combinatorics

Joseph Stack

1,085

asked Jan 12, 2014 at 12:11

9 votes

1 answer

382 views

"Verifiable information": is this a known concept?

cc.complexity-theory reference-request

Vanessa

2,131

asked Dec 28, 2012 at 12:24

9 votes

1 answer

355 views

Transition monoid membership for DFAs

automata-theory regular-language monoid

maomao

1,345

asked May 17, 2017 at 21:28

8 votes

0 answers

113 views

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

ds.algorithms reference-request optimization

Joseph Stack

1,085

asked Aug 7, 2014 at 10:56

8 votes

0 answers

256 views

Existence of "colouring matrices" — a generalisation

co.combinatorics lower-bounds dc.distributed-comp

Jukka Suomela

11.3k

asked Jun 2, 2012 at 19:45

8 votes

2 answers

799 views

Finding a subset of a set in a collection of sets

ds.data-structures

Caleb Poucher

113

asked Jul 21, 2011 at 13:41

8 votes

3 answers

385 views

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

ds.algorithms approximation-algorithms heuristics

Denis

325

asked Dec 23, 2012 at 11:52

Stack Exchange Network

current community

your communities

more stack exchange communities

66 Bookmarks

Monotone complexity of s-t connectivity

what is easy for minor-excluded graphs?

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

Commonest Subsequence

Binary search generalizations for posets?

How many DFAs accept two given strings?

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

What is the complexity of this covering problem?

Convex Body with minimum expected l2 norm

Detecting two kinds of almost-simple polygons

A special class of languages: “circular” languages. Is it known?

Perfect matching of monotone Boolean function with null Euler characteristic

Separating words with random DFAs

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?

Is this problem on unambiguous finite automata NP-complete?

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$