Profile Activity

a3nm

Meta user

Network profile

Reputation

3,724

3.7k
2.8k
2k

2016
2017
2018
2019

Top tag

ds.algorithms

Next privilege

5,000 Rep.

Approve tag wiki edits

Badges

Newest

Revival

Next badge

50/100

Impact

13 posts edited

15 helpful flags

431 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

49 Favorites

Added Views Newest Activity Votes

votes

answer

140

views

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

Oct 6 at 20:59 Abuzer Yakaryilmaz 2,660

votes

answer

181

views

Holant problems and holographic reduction: simple graphs or multigraphs?

counting-complexity

Aug 28 at 11:55 a3nm 3,724

votes

answers

321

views

A variant of #POSITIVE-2-DNF

reference-request counting-complexity

Aug 9 at 19:04 M.Monet 503

votes

answers

views

Counting matchings on 3-regular bipartite graphs

counting-complexity matching bipartite-graphs

Jul 9 at 23:38 M.Monet 503

votes

answers

345

views

Perfect matching of monotone Boolean function with null Euler characteristic

boolean-functions matching monotone

May 26 at 16:56 Lieuwe Vinkhuijzen 1,080

votes

answers

138

views

NP-hardness proof of selecting the ''fittest'' topological sequence of a DAG

np-hardness partial-order topological-graph-theory

Apr 17 at 6:51 user51340 51

votes

answers

182

views

Largest “non-disturbing” subset in a graph

graph-algorithms

Apr 12 at 7:29 Egor Skriptunoff 131

votes

answer

167

views

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

boolean-functions combinatorics lattice

Apr 1 at 20:09 M.Monet 503

votes

answers

153

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 at 12:42 Victor 135

votes

answers

936

views

what is easy for minor-excluded graphs?

ds.algorithms graph-theory graph-minor

Jan 4 at 10:32 Rupei Xu 1,386

vote

answers

views

Points of a finite set wihtin a ball

ds.data-structures computational-geometry metric-spaces

Dec 25 at 8:40 C.P. 630

votes

answers

149

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 327

votes

answer

334

views

“Verifiable information”: is this a known concept?

cc.complexity-theory reference-request

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

votes

answer

220

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 343

votes

answer

187

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 9,279

votes

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 905

votes

answer

410

views

What is the complexity of this graph problem?

graph-theory graph-algorithms np-hardness

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

votes

answer

240

views

Transition monoid membership for DFAs

automata-theory regular-language monoid

May 18 '17 at 0:12 D.W. 7,751

votes

answers

542

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

votes

answers

views

Complexity of computing the simplicial width of a graph

reference-request graph-theory clique treewidth

Nov 29 '16 at 13:40 Community♦ 1

votes

answers

169

views

NP-completeness of a specific topological sorting problem

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

Sep 26 '16 at 16:10 Community♦ 1

votes

answer

182

views

Tree-decomposition with clique interfaces

reference-request graph-theory clique treewidth

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

votes

answer

308

views

Separating words with random DFAs

dfa random-graphs

Dec 26 '15 at 20:55 Community♦ 1

votes

answer

482

views

Simple path on dag with backward edges

graph-algorithms time-complexity disjoint-paths

Aug 17 '15 at 20:47 Community♦ 1

votes

answers

622

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

votes

answers

520

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 21

votes

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 825

votes

answer

100

views

Upper bound to number of closed itemsets

co.combinatorics upper-bounds data-mining

May 7 '14 at 0:44 Magic Banana 31

votes

answers

230

views

Hardness of optimal sorting

ds.algorithms lower-bounds sorting

Feb 19 '14 at 9:43 Joseph Stack 825

votes

answers

147

views

Lower bound for the maximal vectors problem

ds.algorithms reference-request cg.comp-geom optimization

Feb 6 '14 at 17:52 Joseph Stack 825

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

49 Favorites

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

NP-hardness proof of selecting the ''fittest'' topological sequence of a DAG

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

NP-completeness of a specific topological sorting problem

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

Hardness of optimal sorting

Lower bound for the maximal vectors problem