The Sherali-Adams Hierarchy for Promise CSPs through Tensors. - Lorenzo Ciardo; Stanislav Zivný (CoRR, 2022)

Hierarchies of Minion Tests for PCSPs through Tensors. - Lorenzo Ciardo; Stanislav Zivný (SODA, 2023)

Approximate Graph Colouring and Crystals. - Lorenzo Ciardo; Stanislav Zivný (SODA, 2023)

Approximate Graph Colouring and the Hollow Shadow. - Lorenzo Ciardo; Stanislav Zivný (STOC, 2023)

On the complexity of the approximate hypergraph homomorphism problem. - Lorenzo Ciardo; Marcin Kozik; Andrei A. Krokhin; Tamio-Vesa Nakajima; Stanislav Zivný (CoRR, 2023)

CLAP: A New Algorithm for Promise CSPs. - Lorenzo Ciardo; Stanislav Zivný (SIAM J. Comput., 2023)

Quantum advantage and CSP complexity. - Lorenzo Ciardo (LICS, 2024)

The periodic structure of local consistency. - Lorenzo Ciardo; Stanislav Zivný (CoRR, 2024)

Semidefinite Programming and Linear Equations vs. Homomorphism Problems. - Lorenzo Ciardo; Stanislav Zivný (SIAM J. Comput., 2025)

Classical Simulation of Quantum CSP Strategies. - Demian Banakh; Lorenzo Ciardo; Marcin Kozik; Jan Tulowiecki (CoRR, 2025)

On the Quantum Chromatic Gap. - Lorenzo Ciardo (CoRR, 2025)

1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise. - Lorenzo Ciardo; Marcin Kozik; Andrei A. Krokhin; Tamio-Vesa Nakajima; Stanislav Zivný (ACM Trans. Comput. Log., 2025)