Lorenzo Ciardo

28 papers A* 10Journal 18

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. SODA Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný
2026	J	`jnl`	New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs. CoRR Joshua Brakensiek, Lorenzo Ciardo, Venkatesan Guruswami, Aaron Potechin, Stanislav Zivný
2026	A*	`conf`	On the Quantum Chromatic Gap. SODA Lorenzo Ciardo
2026	J	`jnl`	Quantum advantage and CSP complexity. J. Comb. Theory B Lorenzo Ciardo
2025	J	`jnl`	1-in-3 vs. Not-All-Equal: Dichotomy of a Broken Promise. ACM Trans. Comput. Log. Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2025	J	`jnl`	Approximate Graph Coloring and the Crystal with a Hollow Shadow. SIAM J. Comput. Lorenzo Ciardo, Stanislav Zivný
2025	A*	`conf`	Classical Simulation of Quantum CSP Strategies. LICS Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki
2025	J	`jnl`	Classical Simulation of Quantum CSP Strategies. CoRR Demian Banakh, Lorenzo Ciardo, Marcin Kozik, Jan Tulowiecki
2025	J	`jnl`	On the Quantum Chromatic Gap. CoRR Lorenzo Ciardo
2025	J	`jnl`	Quantum Polymorphisms and Commutativity Gadgets. CoRR Lorenzo Ciardo, Gideo Joubert, Antoine Mottet
2025	J	`jnl`	Semidefinite Programming and Linear Equations vs. Homomorphism Problems. SIAM J. Comput. Lorenzo Ciardo, Stanislav Zivný
2024	A*	`conf`	1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise. LICS Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2024	J	`jnl`	Quantum Advantage and CSP Complexity. CoRR Lorenzo Ciardo
2024	A*	`conf`	Quantum advantage and CSP complexity. LICS Lorenzo Ciardo
2024	A*	`conf`	Semidefinite Programming and Linear Equations vs. Homomorphism Problems. STOC Lorenzo Ciardo, Stanislav Zivný
2024	J	`jnl`	The periodic structure of local consistency. CoRR Lorenzo Ciardo, Stanislav Zivný
2023	A*	`conf`	Approximate Graph Colouring and Crystals. SODA Lorenzo Ciardo, Stanislav Zivný
2023	A*	`conf`	Approximate Graph Colouring and the Hollow Shadow. STOC Lorenzo Ciardo, Stanislav Zivný
2023	J	`jnl`	CLAP: A New Algorithm for Promise CSPs. SIAM J. Comput. Lorenzo Ciardo, Stanislav Zivný
2023	A*	`conf`	Hierarchies of Minion Tests for PCSPs through Tensors. SODA Lorenzo Ciardo, Stanislav Zivný
2023	J	`jnl`	On the complexity of the approximate hypergraph homomorphism problem. CoRR Lorenzo Ciardo, Marcin Kozik, Andrei A. Krokhin, Tamio-Vesa Nakajima, Stanislav Zivný
2023	J	`jnl`	Semidefinite programming and linear equations vs. homomorphism problems. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	J	`jnl`	Approximate Graph Colouring and Crystals. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	J	`jnl`	Approximate Graph Colouring and the Hollow Shadow. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	A*	`conf`	CLAP: A New Algorithm for Promise CSPs. SODA Lorenzo Ciardo, Stanislav Zivný
2022	J	`jnl`	Hierarchies of Minion Tests for PCSPs through Tensors. CoRR Lorenzo Ciardo, Stanislav Zivný
2022	J	`jnl`	The Sherali-Adams Hierarchy for Promise CSPs through Tensors. CoRR Lorenzo Ciardo, Stanislav Zivný
2021	J	`jnl`	CLAP: A New Algorithm for Promise CSPs. CoRR Lorenzo Ciardo, Stanislav Zivný