the complexity of somewhat approximation resistant predicates
Published 10 years ago • 292 plays • Length 25:09Download video MP4
Download video MP3
Similar videos
-
32:25
a characterization of strong approximation resistance
-
16:10
proof complexity and tfnp
-
47:20
counting approximation complexity classification through clones and invariants
-
35:00
approximating certain and possible answers beyond sets
-
28:29
arbitrary mixtures of boolean, monotone, and tensor independence
-
46:12
clique is hard on average for regular resolution
-
1:21:08
17. complexity: approximation algorithms
-
57:01
fine-grained complexity of exact algorithms
-
33:59
the complexity of approximating small degree boolean #csp
-
21:03
query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate
-
33:21
sos and the dreaded bit-complexity
-
48:41
the complexity of computing quantities
-
41:11
proof complexity a
-
1:01:51
the complexity of dynamic least-squares regression
-
1:13:54
approximation power
-
26:50
approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs
-
1:02:04
fine-grained counting complexity i
-
40:01
approximation algorithms for optimization under uncertainty
-
59:41
average-case complexity theory
-
1:06:56
fine-grained complexity 3