On the complexity of CSP-based ideal membership problems

Andrei A. Bulatov, Akbar Rafiey. On the complexity of CSP-based ideal membership problems. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 436-449, ACM, 2022. [doi]

Abstract

Abstract is missing.