User a3nm

8

votes

0

answers

96

views

Deciding whether DCFG is visibly pushdown

Jan 2 at 20:34 Hermann Gruber 5,039

6

votes

0

answers

133

views

Computing and maintaining the minimum of a set $S$ of integers while allowing updates on $S$

ds.algorithms reference-request lower-bounds sorting ram-model

Nov 8 at 13:39 Louis 360

1

vote

1

answer

124

views

Face-splitting product of two Vandermonde matrices: When is is invertible?

linear-algebra matrix-product

Oct 7 at 16:00 J.G 655

9

votes

1

answer

155

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

317

views

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

ds.algorithms complexity machine-models

May 25 at 7:28 David Eppstein 49.3k

5

votes

0

answers

186

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

8

votes

4

answers

531

views

Constraints on sliding windows

automata-theory complexity streaming-algorithms sliding-window

May 6 at 8:15 Louis 360

10

votes

1

answer

347

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

7

votes

1

answer

208

views

Holant problems and holographic reduction: simple graphs or multigraphs?

counting-complexity

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

4

votes

2

answers

333

views

A variant of #POSITIVE-2-DNF

reference-request counting-complexity

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

5

votes

0

answers

112

views

Counting matchings on 3-regular bipartite graphs

counting-complexity matching bipartite-graphs

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

18

votes

0

answers

393

views

Perfect matching of monotone Boolean function with null Euler characteristic

boolean-functions matching monotone

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

6

votes

0

answers

184

views

Largest “non-disturbing” subset in a graph

graph-algorithms

Apr 12 '19 at 7:29 Egor Skriptunoff 161

4

votes

1

answer

192

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 981

2

votes

2

answers

195

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 Community♦ 1

1

vote

0

answers

76

views

Points of a finite set wihtin a ball

ds.data-structures computational-geometry metric-spaces

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

6

votes

0

answers

162

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 637

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

7

votes

1

answer

236

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

203

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 13.2k

6

votes

0

answers

139

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

17

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

9

votes

1

answer

306

views

Transition monoid membership for DFAs

automata-theory regular-language monoid

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

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

7

votes

0

answers

94

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

218

views

Tree-decomposition with clique interfaces

reference-request graph-theory clique treewidth

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

15

votes

1

answer

346

views

Separating words with random DFAs

dfa random-graphs

Dec 26 '15 at 20:55 Community♦ 1

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

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

54 Bookmarks

Deciding whether DCFG is visibly pushdown

Computing and maintaining the minimum of a set $S$ of integers while allowing updates on $S$

Face-splitting product of two Vandermonde matrices: When is is invertible?

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