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

786

views

On finding a chain decomposition of a Partial Order

Sep 16 '11 at 5:12 Sasho Nikolov 16.7k

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

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

answers

149

views

Optimal set union tree

optimization tree binary-trees set-system

Oct 14 '18 at 15:57 AmeerJ 327

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

answers

181

views

Tree search guided by a probabilistic oracle

ds.algorithms pr.probability tree search-problem

Aug 15 '12 at 12:44 Foo Barrigno 179

votes

answer

162

views

Cayley subgraph isomorphism and complexity of linear subcode decision

graph-theory graph-isomorphism

Oct 15 '13 at 17:58 Joshua Grochow 30.7k

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

321

views

A variant of #POSITIVE-2-DNF

reference-request counting-complexity

Aug 9 at 19:04 M.Monet 503

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

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

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

223

views

Can relativization change the direction of separation?

cc.complexity-theory relativization

Jan 30 '13 at 7:47 Kaveh 16.4k

votes

answers

219

views

Grouping a set of rectangles in larger rectangular regions

cg.comp-geom clustering

May 22 '13 at 16:10 rivu 116

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

519

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

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

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

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

49 Favorites

On finding a chain decomposition of a Partial Order

Holant problems and holographic reduction: simple graphs or multigraphs?

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

Largest “non-disturbing” subset in a graph

Optimal set union tree

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

Tree search guided by a probabilistic oracle

Cayley subgraph isomorphism and complexity of linear subcode decision

Counting matchings on 3-regular bipartite graphs

A variant of #POSITIVE-2-DNF

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

NP-completeness of a specific topological sorting problem

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

Can relativization change the direction of separation?

Grouping a set of rectangles in larger rectangular regions

Upper bound to number of closed itemsets

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

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

Points of a finite set wihtin a ball