Theoretical Computer Science
mhum's user avatar
mhum's user avatar
mhum's user avatar
mhum
  • Member for 13 years, 3 months
  • Last seen more than a week ago
Profile Activity
Stats
3,382
reputation
240k
reached
35
answers
2
questions
Communities
View all
Badges
View all badges
1
gold badge
21
silver badges
22
bronze badges
Top tags
View all tags
108
Score
9
Posts
24
Posts %
59
Score
10
Posts
27
Posts %
55
Score
3
Posts
8
Posts %
52
Score
6
Posts
16
Posts %
48
Score
9
Posts
24
Posts %
39
Score
3
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
30
Core algorithms deployed
Nov 12, 2013
answer
23
Core algorithms deployed
Nov 12, 2013
answer
19
Why is "topological sorting" topological?
Mar 2, 2015
answer
18
Positive topological ordering
Oct 5, 2010
question
17
Boolean Functions Where Sensitivity Equals Block Sensitivity
Nov 21, 2013
answer
16
Prove that the problem of rectilinear picture compression is np-complete
Dec 23, 2010
answer
14
Need an efficient algorithm to visit all nodes of a graph, revisiting edges and nodes is allowed
Aug 3, 2011
answer
11
Is counting maximal cliques in an incomparability graph #P-complete?
Aug 6, 2011
answer
11
Sampling monotone Boolean functions
May 21, 2019
answer
10
Collatz Conjecture & Grammars / Automata
Mar 28, 2011
Top network posts
View all network posts
126
Data structures for 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"
26
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.