|
111 |
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs
d'Orsi, Tommaso. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
112 |
An Algorithmic Approach to Uniform Lower Bounds
Santhanam, Rahul. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
113 |
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
Ambainis, Andris. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
114 |
An Improved Trickle down Theorem for Partite Complexes
Abdolazimi, Dorna. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
115 |
Border Complexity of Symbolic Determinant Under Rank One Restriction
Chatterjee, Abhranil. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
116 |
Bounded Relativization
Hirahara, Shuichi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
117 |
Colourful TFNP and Propositional Proofs
Davis, Ben. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
|
|
118 |
Computational and Mathematical Models in Biology
Cham : Springer Nature Switzerland, 2023, 1st edition 2023
|
|
|
|
119 |
Computational Complexity and Delay Reduction for RLNC Single and Multi-hop Communications
Taşdemir, Elif. - Dresden : Technische Universität Dresden, 2023
|
|
|
|
120 |
Computational Complexity of Path Planning Algorithms Based on Safe Triangles and Quadtree as Work Space Representations: A Comparison
Mao, Xiaozhao. - Darmstadt : Universitäts- und Landesbibliothek, 2023
|
|
Administration
