Skip to main content
New
Stack Overflow Jobs powered by Indeed: A job site that puts thousands of tech jobs at your fingertips (U.S. only). Search jobs
mhum's user avatar
mhum's user avatar
mhum's user avatar
mhum
  • Member for 13 years, 8 months
  • Last seen this week
30 votes

Core algorithms deployed

23 votes

Core algorithms deployed

19 votes
Accepted

Why is "topological sorting" topological?

18 votes
Accepted

Positive topological ordering

16 votes

Prove that the problem of rectilinear picture compression is np-complete

14 votes
Accepted

Need an efficient algorithm to visit all nodes of a graph, revisiting edges and nodes is allowed

11 votes
Accepted

Is counting maximal cliques in an incomparability graph #P-complete?

11 votes
Accepted

Sampling monotone Boolean functions

10 votes

Collatz Conjecture & Grammars / Automata

9 votes

Recognizing line graphs of hypergraphs

8 votes
Accepted

"a" or "an" with big O notation?

7 votes

What hierarchies and/or hierarchy theorems do you know?

7 votes

Parity and circuit complexity

7 votes

Extension to the Stable Marriage Problem ?

7 votes
Accepted

How powerful is POSIX regex

6 votes
Accepted

Minimal bandwidth required to synchronize two sets of values

6 votes
Accepted

Complexity of "destroying" the graph's minimum spanning tree weight

5 votes
Accepted

Computing the edge orbits of a graph (and discussing definitions)

5 votes
Accepted

Is public-key spread-spectrum communication possible?

4 votes
Accepted

What is the first name of Bainbridge?

4 votes

Complexity of Uniform Generation of Perfect Matchings

4 votes

Alternative Turing Machine Proofs

4 votes
Accepted

Is it easy to "fit a wrapped chain in a graph"?

4 votes
Accepted

How many words of length $k$ on $l$ letters avoid a partial word?

4 votes
Accepted

Is the problem "MIN-SET-PARTITION" an NP-hard problem?

3 votes

Sending people to lunch together with minimal repetition

3 votes
Accepted

Extracting Independent Information About Sequences

3 votes

What hierarchies and/or hierarchy theorems do you know?

2 votes

Certainty of mutual confirmation over faulty channels?

2 votes

Lexicographically minimal topological sort of a labeled DAG