Pubblicazioni

Space proof complexity for random 3-CNFs

2017 - INFORMATION AND COMPUTATION
Bennett, Patrick; Bonacina, Ilario; Galesi, Nicola; Huynh, Tony; Molloy, Mike; Wollan, PAUL JOSEPH

Graph colouring is hard for algorithms based on hilbert's nullstellensatz and gröbner bases

2017 - Leibniz International Proceedings in Informatics, LIPIcs
Lauria, Massimo; Nordström, Jakob

© Università degli Studi di Roma "La Sapienza" - Piazzale Aldo Moro 5, 00185 Roma