default search action
"Simplified inpproximability of hypergraph coloring via t-agreeing families."
Per Austrin, Amey Bhangale, Aditya Potukuchi (2019)
- Per Austrin, Amey Bhangale, Aditya Potukuchi:
Simplified inpproximability of hypergraph coloring via t-agreeing families. CoRR abs/1904.01163 (2019)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.