|
11 |
Computational Complexity of the Weisfeiler-Leman Dimension
Lichter, Moritz. - Aachen : Universitätsbibliothek der RWTH Aachen, 2025
|
|
|
|
12 |
Computational Limits of Population Protocols: Space Complexity, Robustness and Expressive Power
Czerner, Philipp. - München : Universitätsbibliothek der TU München, 2025
|
|
|
|
13 |
Counting Martingales for Measure and Dimension in Complexity Classes
Hitchcock, John M.. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
14 |
Cybercrime Unveiled: Technologies for Analysing Legal Complexity
Cham : Springer Nature Switzerland, Imprint: Springer, 2025, 1st ed. 2025
|
|
|
|
15 |
Direct Sums for Parity Decision Trees
Besselman, Tyler. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
16 |
Directed st-Connectivity with Few Paths Is in Quantum Logspace
Apers, Simon. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
17 |
From an Odd Arity Signature to a Holant Dichotomy
Meng, Boning. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
18 |
Front Matter, Table of Contents, Preface, Conference Organization
Srinivasan, Srikanth. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
19 |
Generalised Linial-Nisan Conjecture Is False for DNFs
Alekseev, Yaroslav. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
|
|
20 |
Hardness Amplification for Real-Valued Functions
Li, Yunqi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2025
|
|
Administration
