19 citations · 19 across the 2 of their papers we have counts for
2 papers
cs.DS2008★ 19 cited
Exponential-Time Approximation of Hard Problems
Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk +1
We study optimization problems that are neither approximable in polynomial time (at least with a constant factor) nor fixed parameter tractable, under widely believed complexity as…
math.PR2008
The negative association property for the absolute values of random variables equidistributed on a generalized Orlicz ball
Marcin Pilipczuk, Jakub Onufry Wojtaszczyk
Random variables equidistributed on convex bodies have received quite a lot of attention in the last few years. In this paper we prove the negative association property (which gene…