D2.A — Parameterized inapproximability for Steiner Orientation by gap amplification

preview_player
Показать описание
ICALP-A 2020
Parameterized inapproximability for Steiner Orientation by gap amplification
Michal Wlodarczyk
  1. Saarland Informatics Campus
Рекомендации по теме
D2.A — Parameterized 0:26:13

D2.A — Parameterized inapproximability for Steiner Orientation by gap amplification

Parameterized Inapproximability for 0:56:38

Parameterized Inapproximability for Steiner Orientation by Gap Amplification

Kernels - I 1:05:06

Kernels - I | Roohani Sharma | Parameterized Complexity Workshop

Abhishek Rathod (7/27/70): 0:33:42

Abhishek Rathod (7/27/70): Hardness results in discrete Morse theory for 2-complexes

Active learning a 0:23:51

Active learning a convex body in low dimensions (ICALP 2020)

D4.D — Timed 0:19:19

D4.D — Timed games and deterministic separability

F3.A — Finite 0:25:29

F3.A — Finite Sequentiality of Finitely Ambiguous Max-Plus Tree Automata

D1.A — Tree 0:20:28

D1.A — Tree Polymatrix Games are PPAD-hard

C2.D – Can 0:25:04

C2.D – Can Verifiable Delay Functions be Based on Random Oracles?

B4.B — Hrushovski's 0:25:11

B4.B — Hrushovski's encoding and ω-categorical CSP monsters

6.047/6.878 Lecture 11 1:27:04

6.047/6.878 Lecture 11 - Networks (Fall 2020)