|
41 |
Super-Critical Trade-Offs in Resolution over Parities via Lifting
Chattopadhyay, Arkadev. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
42 |
Switching Graph Matrix Norm Bounds: From i.i.d. to Random Regular Graphs
Xu, Jeff. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
43 |
The Computational Complexity of Factored Graphs
Gupta, Shreya. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
44 |
Tight Bounds for Stream Decodable Error-Correcting Codes
Gupta, Meghal. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
45 |
Towards Free Lunch Derandomization from Necessary Assumptions (And OWFs)
Ball, Marshall. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
46 |
Witness Encryption and NP-Hardness of Learning
Goldberg, Halley. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
47 |
Inductive inference of lindenmayer systems: algorithms and computational complexity
Enthalten in Natural computing 10.6.2025: 1-11
|
|
|
|
48 |
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
|
|
|
|
49 |
Computational complexity and exact techniques for scheduling problems with job prohibitions
Enthalten in Journal of scheduling 2.4.2025: 1-18
|
|
|
|
50 |
Algebraic and Analytic Methods in Computational Complexity (Dagstuhl Seminar 24381)
Enthalten in Schloss Dagstuhl, Leibniz-Zentrum für Informatik: Dagstuhl Reports 2025, Volume 14, Issue 9, page 104-126
|
|
Administration
