Even Delta-Matroids and the Complexity of Planar Boolean CSPs - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alexandr Kazda, Vladimir Kolmogorov, Michal Rolínek. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 307-326, SIAM, 2017. [doi]

This author has not been identified. Look up 'Alexandr Kazda' in GoogleThis author has not been identified. Look up 'Vladimir Kolmogorov' in GoogleThis author has not been identified. Look up 'Michal Rolínek' in Google

runs on WebDSL