User a3nm

9

votes

1

answer

146

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

6

votes

2

answers

302

views

On the complexity of a “list” datastructure in the RAM model

ds.algorithms complexity machine-models

May 25 at 7:28 David Eppstein 48.6k

4

votes

0

answers

181

views

NP-completeness of a specific topological sorting problem

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

May 15 at 15:46 a3nm 6,766

8

votes

4

answers

470

views

Constraints on sliding windows

automata-theory complexity streaming-algorithms sliding-window

May 6 at 8:15 Louis 300

10

votes

1

answer

206

views

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

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

Oct 6 at 20:59 Community♦ 1

7

votes

1

answer

192

views

Holant problems and holographic reduction: simple graphs or multigraphs?

counting-complexity

Aug 28 at 11:55 a3nm 6,766

4

votes

2

answers

329

views

A variant of #POSITIVE-2-DNF

reference-request counting-complexity

Aug 9 '19 at 19:04 M.Monet 931

5

votes

0

answers

101

views

Counting matchings on 3-regular bipartite graphs

counting-complexity matching bipartite-graphs

Jul 9 '19 at 23:38 M.Monet 931

17

votes

0

answers

377

views

Perfect matching of monotone Boolean function with null Euler characteristic

boolean-functions matching monotone

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

6

votes

0

answers

183

views

Largest “non-disturbing” subset in a graph

graph-algorithms

Apr 12 '19 at 7:29 Egor Skriptunoff 161

4

votes

1

answer

184

views

Möbius values of CNF and DNF lattices of a monotone Boolean function

boolean-functions combinatorics lattice

Apr 1 '19 at 20:09 M.Monet 931

2

votes

2

answers

170

views

Is S-T CONNECTEDNESS #P-complete on instances when all s-t paths are of the same length?

cc.complexity-theory counting-complexity

Jan 22 '19 at 12:42 Victor 165

31

votes

5

answers

1k

views

what is easy for minor-excluded graphs?

ds.algorithms graph-theory graph-minor

Jan 4 '19 at 10:32 Rupei Xu 2,329

1

vote

0

answers

74

views

Points of a finite set wihtin a ball

ds.data-structures computational-geometry metric-spaces

Dec 25 '18 at 8:40 C.P. 972

6

votes

0

answers

157

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 587

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

7

votes

1

answer

225

views

How fast can we find and disconnect roots in a forest?

ds.data-structures lower-bounds tree

May 21 '18 at 4:45 Dmitri Urbanowicz 378

4

votes

1

answer

191

views

How hard is it to determine the chromatic number of a unit distance graph?

cc.complexity-theory graph-theory np-hardness planar-graphs

May 18 '18 at 20:54 domotorp 12.9k

6

votes

0

answers

138

views

Has what I am calling “helpfulness” here been studied?

reference-request circuit-complexity boolean-functions

Mar 15 '18 at 20:38 Samuel Schlesinger 1,592

16

votes

1

answer

435

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.3k

9

votes

1

answer

290

views

Transition monoid membership for DFAs

automata-theory regular-language monoid

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

15

votes

0

answers

555

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

7

votes

0

answers

90

views

Complexity of computing the simplicial width of a graph

reference-request graph-theory clique treewidth

Nov 29 '16 at 13:40 Community♦ 1

7

votes

1

answer

201

views

Tree-decomposition with clique interfaces

reference-request graph-theory clique treewidth

Mar 16 '16 at 17:54 David Eppstein 48.6k

15

votes

1

answer

328

views

Separating words with random DFAs

dfa random-graphs

Dec 26 '15 at 20:55 Community♦ 1

10

votes

0

answers

530

views

Simple path on dag with backward edges

graph-algorithms time-complexity disjoint-paths

Aug 17 '15 at 20:47 Community♦ 1

27

votes

0

answers

635

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

2

votes

2

answers

542

views

Has this formulation of pursuit evasion been researched? Similar to Helicopter Cops and Robbers Game

graph-theory graph-algorithms

Jun 3 '15 at 20:18 Edvin 31

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

2

votes

1

answer

103

views

Upper bound to number of closed itemsets

co.combinatorics upper-bounds data-mining

May 7 '14 at 0:44 Magic Banana 31

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

51 Bookmarks

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

On the complexity of a “list” datastructure in the RAM model

NP-completeness of a specific topological sorting problem

Constraints on sliding windows

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

Holant problems and holographic reduction: simple graphs or multigraphs?

A variant of #POSITIVE-2-DNF

Counting matchings on 3-regular bipartite graphs

Perfect matching of monotone Boolean function with null Euler characteristic

Largest “non-disturbing” subset in a graph

Möbius values of CNF and DNF lattices of a monotone Boolean function

Is S-T CONNECTEDNESS #P-complete on instances when all s-t paths are of the same length?

what is easy for minor-excluded graphs?

Points of a finite set wihtin a ball

Optimal set union tree

“Verifiable information”: is this a known concept?

How fast can we find and disconnect roots in a forest?

How hard is it to determine the chromatic number of a unit distance graph?

Has what I am calling “helpfulness” here been studied?

What is the complexity of this graph problem?

Transition monoid membership for DFAs

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

Complexity of computing the simplicial width of a graph

Tree-decomposition with clique interfaces

Separating words with random DFAs

Simple path on dag with backward edges

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

Has this formulation of pursuit evasion been researched? Similar to Helicopter Cops and Robbers Game

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

Upper bound to number of closed itemsets