"Simplified inpproximability of hypergraph coloring via t-agreeing families."

Per Austrin, Amey Bhangale, Aditya Potukuchi (2019)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-27

a service of  Schloss Dagstuhl - Leibniz Center for Informatics