|
81 |
Search-To-Decision Reductions for Kolmogorov Complexity
Mazor, Noam. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
82 |
Solving Unique Games over Globally Hypercontractive Graphs
Bafna, Mitali. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
83 |
Space Complexity of Euclidean Clustering
Zhu, Xiaoyi. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
84 |
Streaming Zero-Knowledge Proofs
Cormode, Graham. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
85 |
The Computational Advantage of MIP^∗ Vanishes in the Presence of Noise
Dong, Yangjing. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
|
86 |
The Entangled Quantum Polynomial Hierarchy Collapses
Grewal, Sabee. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2024
|
|
|
87 |
The computational complexity of finding stationary points in non-convex optimization
Enthalten in Mathematical programming 27.9.2024: 1-61
|
|
|
|
88 |
Reflections on Simplicity and Complexity in Computational Neuroscience
Enthalten in Human arenas 21.6.2024: 1-9
|
|
|
|
89 |
Unraveling the complexity of vascular tone regulation: a multiscale computational approach to integrating chemo-mechano-biological pathways with cardiovascular biomechanics
Enthalten in Biomechanics and modeling in mechanobiology 20.3.2024: 1-30
|
|
|
|
90 |
A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph
Kunisky, Dmitriy. - Wadern : Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023
|
|
Administration
