de Rezende, S. F., Engström, D., Ghannane, Y., & Risse, K. (2026). Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size.
Chicago-Zitierstil (17. Ausg.)de Rezende, Susanna F., David Engström, Yassine Ghannane, und Kilian Risse. Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size. 2026.
MLA-Zitierstil (9. Ausg.)de Rezende, Susanna F., et al. Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size. 2026.
Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.