Login / Signup
Simplified inpproximability of hypergraph coloring via t-agreeing families.
Per Austrin
Amey Bhangale
Aditya Potukuchi
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
higher order
pairwise
multiscale
np hard
hypergraph model
neural network
artificial intelligence
computer vision
image segmentation
bayesian networks
data structure
digital libraries
evolutionary algorithm
high order
hypergraph partitioning