The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain

Monaldo Mastrolilli. The Complexity of the Ideal Membership Problem for Constrained Problems Over the Boolean Domain. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 456-475, SIAM, 2019. [doi]

Abstract

Abstract is missing.