Staff profile
Overview
https://apps.dur.ac.uk/biography/image/5539
| Affiliation |
|---|
| Post Doctoral Research Associate in the Department of Computer Science |
Publications
Conference Paper
- Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hardKrokhin, A., & Vagnozzi, D. (in press). Approximating 1-in-3 SAT by linearly ordered hypergraph 3-colouring is NP-hard. In Leibniz International Proceedings in Informatics (LIPIcs).