|
41 |
Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs)
Ball, Marshall. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
42 |
Witness Encryption and NP-Hardness of Learning
Goldberg, Halley. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
43 |
Inductive inference of lindenmayer systems: algorithms and computational complexity
Enthalten in Natural computing 10.6.2025: 1-11
|
|
|
|
44 |
IFIC3A-VSR: A Computational Accelerated Video Super-Resolution Network Based on Inter-frame Information Complexity Classification
Enthalten in Circuits, systems and signal processing 21.4.2025: 1-22
|
|
|
|
45 |
Computational complexity and exact techniques for scheduling problems with job prohibitions
Enthalten in Journal of scheduling 2.4.2025: 1-18
|
|
|
|
46 |
A Strong Direct Sum Theorem for Distributional Query Complexity
Blanc, Guy. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
47 |
A Subquadratic Upper Bound on Sum-Of-Squares Composition Formulas
Hrubeš, Pavel. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
48 |
A Technique for Hardness Amplification Against AC⁰
Hoza, William M.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
49 |
Asymptotically-Good RLCCs with (log n)^(2+o(1)) Queries
Cohen, Gil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
50 |
Baby PIH: Parameterized Inapproximability of Min CSP
Guruswami, Venkatesan. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
Administration
