Computer Science
Manuel Lafond
  • Member for 6 years, 10 months
  • Last seen this week
Profile Activity
Stats
520
reputation
4k
reached
2
answers
10
questions
Communities
View all
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
10
bronze badges
Top tags
View all tags
4
Score
2
Posts
17
Posts %
4
Score
2
Posts
17
Posts %
2
Score
4
Posts
33
Posts %
0
Score
4
Posts
33
Posts %
0
Score
4
Posts
33
Posts %
0
Score
3
Posts
25
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
Votes Newest
9
Hardness of approximating Minimum Cardinality Exact Cover
Jul 26 '18
5
Approximation ratio when optimal solution is $0$
Aug 6 '16
4
Finding the "most modular" subset of graph vertices, i.e. that minimize disagreement inside and outside
Sep 17 '18
4
Is $k$-CLIQUE W[1]-hard for parameter $n - k$?
Nov 21 '17
3
Time complexity of computing binomial coefficients (with binary representation of integers)
Mar 13 '18
3
Number of words within Hamming distance $\delta$
Dec 23 '15
3
Hardness of approximation: what decision problem is hard exactly?
Dec 1 '15
2
Is $k$-CLIQUE W[1]-hard for parameter $n - k$?
Nov 21 '17
2
Is Max-2SAT with exactly 3 occurrences per variable APX-hard?
Sep 20 '16
2
Algorithm to place apples in boxes
May 28 '18
Top network posts
View all network posts
9
A list of XP-hard problems
8
size of an independent set of any graph with $n$ vertices and maximum degree $d$
8
Proof that no trading system always wins
7
If $x * x = e$ for all $x$ and $(x_i * x_j) * (x_j*x_k) = x_i*x_k$, then $*$ is associative
7
Any equivalent to the Four color theorem for non-planar graphs?

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.