Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
Manuel Lafond
http://www-ens.iro.umontreal.ca/~lafonman/en/index.php
top
accounts
reputation
activity
subscriptions
Top Questions
9
votes
A list of XP-hard problems
reductions
parameterized-complexity
asked Apr 14, 2017 at 19:35
cstheory.stackexchange.com
9
votes
Hardness of approximating Minimum Cardinality Exact Cover
algorithms
approximation
set-cover
asked Jul 26, 2018 at 4:43
cs.stackexchange.com
8
votes
Proof that no trading system always wins
mathematics
algorithmic-trading
proof
asked Jan 7, 2016 at 16:11
quant.stackexchange.com
7
votes
If $x * x = e$ for all $x$ and $(x_i * x_j) * (x_j*x_k) = x_i*x_k$, then $*$ is associative
group-theory
associativity
asked Sep 25, 2014 at 16:17
math.stackexchange.com
6
votes
If $\mathbb{E}[X] = 0$, then $P[X \geq \lambda] \leq \frac{\sigma^2}{\sigma^2 + \lambda^2}$
probability
expectation
asked May 13, 2015 at 15:22
math.stackexchange.com
6
votes
Number of linear orderings of a set to have balanced frequencies of triple orders
co.combinatorics
permutations
asked Jun 8, 2016 at 11:41
mathoverflow.net
5
votes
Approximation ratio when optimal solution is $0$
complexity-theory
approximation
asked Aug 6, 2016 at 19:48
cs.stackexchange.com
5
votes
Set cover in which some pairs of sets are forbidden
approximation-algorithms
approximation-hardness
set-cover
asked Feb 17, 2015 at 20:53
cstheory.stackexchange.com
5
votes
Balanced Max-2-SAT NP-Hardness
np-hardness
sat
max2sat
asked Mar 7, 2016 at 19:52
cstheory.stackexchange.com
Top Answers
9
Chromatic index of a complete graph
math.stackexchange.com
9
size of an independent set of any graph with $n$ vertices and maximum degree $d$
math.stackexchange.com
7
Any equivalent to the Four color theorem for non-planar graphs?
math.stackexchange.com
7
Connection between chromatic number and independence number of a graph
math.stackexchange.com
6
Proving a graph is connected by minimum degree
math.stackexchange.com
5
Proof that any self-complementary graph has to have $4k$ or $4k+1$ vertex, for some $k \in \mathbb N$
math.stackexchange.com
5
Theoretical and applied math help - what and why?
math.stackexchange.com
Stack Exchange works best with JavaScript enabled