Theoretical Computer Science
Magnus Wahlström's user avatar
Magnus Wahlström's user avatar
Magnus Wahlström's user avatar
Magnus Wahlström
  • Member for 13 years, 1 month
  • Last seen more than 1 year ago
Profile Activity
Stats
803
reputation
10k
reached
6
answers
1
question
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
4
silver badges
7
bronze badges
Top tags
View all tags
45
Score
4
Posts
57
Posts %
36
Score
2
Posts
29
Posts %
26
Score
2
Posts
29
Posts %
18
Score
1
Posts
14
Posts %
18
Score
1
Posts
14
Posts %
10
Score
1
Posts
14
Posts %
Top posts
All Questions Answers
Score Newest
answer
18
How many instances of 3-SAT are satisfiable?
Oct 18, 2010
answer
18
Theoretical explanations for practical success of SAT solvers?
Apr 2, 2017
answer
10
Problems in $\mathsf{BPP}$ not known to be in $\mathsf P$?
Dec 28, 2014
answer
8
Graph families which have polynomial time algorithms for computing the chromatic number
Aug 26, 2010
answer
5
Two Variants of NP
Aug 21, 2010
answer
4
Implications of approximating the determinant
May 3, 2013
question
2
"Parity testing set" for disjoint pairs of sets
Dec 16, 2020

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.