parameterized inapproximability of max k-subset intersection under eth
Published 8 years ago • 150 plays • Length 29:47Download video MP4
Download video MP3
Similar videos
-
47:32
parameterized inapproximability of the minimum distance problem over all fields...
-
29:28
subexponential parameterized complexity of completion problems: survey of the upper bounds
-
28:17
improved inapproximability of vc dimension and littlestone's dimension via (unbalanced) biclique
-
29:08
an isomorphism between parameterized complexity and classical complexity, for both time and space
-
49:26
leon simon: the singular set of stable minimal hypersurfaces #icbs2024
-
9:10
real analysis 6 | supremum and infimum
-
32:34
dense subset sum may be the hardest
-
3:22
proper subset_super set@rubitheresa
-
14:49
sketching subsets of the complex plane
-
8:02
real analysis 19 | comparison test [dark version]
-
2:44
subset symbol [dark version]
-
12:39
real analysis 21 | reordering for series [dark version]
-
5:56
complex analysis - subsets
-
1:06:50
precise and automated symbolic analysis of concurrent programs
-
38:17
beam moment sparse partials
-
9:14
infimum of a set
-
1:53
solving definite integral using dilogarithm function
-
11:09
decomposition of primes as x^2 /- n * y^2 - infinite descent method 6/7
-
11:28
primes are infinite: *a topological proof*