3 is NP-hard - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Arnaud de Mesmay, Yo'av Rieck, Eric Sedgwick, Martin Tancer. 3 is NP-hard. In Artur Czumaj, editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018. pages 1316-1329, SIAM, 2018. [doi]

This author has not been identified. Look up 'Arnaud de Mesmay' in GoogleThis author has not been identified. Look up 'Yo'av Rieck' in GoogleThis author has not been identified. Look up 'Eric Sedgwick' in GoogleThis author has not been identified. Look up 'Martin Tancer' in Google

runs on WebDSL