Lorenzo Ciardo

Orcid: 0000-0001-9491-2016

Affiliations:
  • TU Graz, Austria
  • University of Oxford, UK (former)


According to our database1, Lorenzo Ciardo authored at least 13 papers between 2022 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On the Quantum Chromatic Gap.
CoRR, March, 2025

Approximate Graph Coloring and the Crystal with a Hollow Shadow.
SIAM J. Comput., 2025

Classical Simulation of Quantum CSP Strategies.
Proceedings of the 40th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025

2024
The periodic structure of local consistency.
CoRR, 2024

Semidefinite Programming and Linear Equations vs. Homomorphism Problems.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

1-in-3 vs. Not-All-Equal: Dichotomy of a broken promise.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Quantum advantage and CSP complexity.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023
On the complexity of the approximate hypergraph homomorphism problem.
CoRR, 2023

Approximate Graph Colouring and the Hollow Shadow.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Approximate Graph Colouring and Crystals.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Hierarchies of Minion Tests for PCSPs through Tensors.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
The Sherali-Adams Hierarchy for Promise CSPs through Tensors.
CoRR, 2022

CLAP: A New Algorithm for Promise CSPs.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022


  Loading...