Theoretical Computer Science
mhum
  • Member for 11 years, 1 month
Profile Activity
Stats
3,342
reputation
231k
reached
35
answers
2
questions
Communities
View all
Badges
View all badges
1
gold badge
19
silver badges
22
bronze badges
Top tags
View all 53 tags
108
Score
9
Posts
24
Posts %
59
Score
10
Posts
27
Posts %
55
Score
3
Posts
8
Posts %
48
Score
6
Posts
16
Posts %
44
Score
9
Posts
24
Posts %
35
Score
3
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
30
Core algorithms deployed
Nov 12 '13
23
Core algorithms deployed
Nov 12 '13
18
Positive topological ordering
Oct 5 '10
17
Boolean Functions Where Sensitivity Equals Block Sensitivity
Nov 21 '13
16
Prove that the problem of rectilinear picture compression is np-complete
Dec 23 '10
15
Why is "topological sorting" topological?
Mar 2 '15
14
Need an efficient algorithm to visit all nodes of a graph, revisiting edges and nodes is allowed
Aug 3 '11
11
Is counting maximal cliques in an incomparability graph #P-complete?
Aug 6 '11
11
Sampling monotone Boolean functions
May 21 '19
10
Collatz Conjecture & Grammars / Automata
Mar 28 '11
Top network posts
View all
122
What are efficient data structures and algorithms for simulating loaded dice?
36
Example of a Mathematician/Physicist whose Other Publications during their PhD eclipsed their PhD Thesis
27
History of "without loss of generality"
25
Titles composed entirely of math symbols
23
The $5n+1$ Problem

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.