"2(\log N)1/4-o(1) Hardness for Hypergraph Coloring."

Sangxia Huang (2015)

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