|
61 |
Derandomizing Logspace with a Small Shared Hard Drive
Pyne, Edward. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
62 |
Dimension Independent Disentanglers from Unentanglement and Applications
Jeronimo, Fernando Granha. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
63 |
Disentangling the Computational Complexity of Network Untangling
Froese, Vincent. - Berlin : Humboldt-Universität zu Berlin, 2024
|
|
|
|
64 |
Distribution-Free Proofs of Proximity
Aaronson, Hugo. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
65 |
Exact Search-To-Decision Reductions for Time-Bounded Kolmogorov Complexity
Hirahara, Shuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
66 |
Explicit Directional Affine Extractors and Improved Hardness for Linear Branching Programs
Li, Xin. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
67 |
Explicit Time and Space Efficient Encoders Exist Only with Random Access
Cook, Joshua. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
68 |
Exponential Separation Between Powers of Regular and General Resolution over Parities
Bhattacharya, Sreejata Kishor. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
69 |
Failure of Feasible Disjunction Property for k-DNF Resolution and NP-Hardness of Automating It
Garlík, Michal. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
70 |
Finding Missing Items Requires Strong Forms of Randomness
Chakrabarti, Amit. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
