application of backward probability method in pollutant source tracking in non-uniform flow riversalireza ghanem.sc. student of water structures, tarbiat modares university, tehranmehdi mazaheri assistant prof., department of water structures, tarbiat modares university, tehranjamal mohammad vali samaniprofessor, department of water structures, tarbiat modares university, tehranintroductionriv...

We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) 1/10−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22Ω( √ log logN) colors. Their result is obtain...

We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2 1/8−o(1) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, H̊astad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2 Ω( √ log log N) colors. Their result is obtained by ...

We show that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 2(logN) colors, where N is the number of vertices. There has been much focus on hardness of hypergraph coloring recently. In [17], Guruswami, Håstad, Harsha, Srinivasan and Varma showed that it is quasi-NP-hard to color 2-colorable 8-uniform hypergraphs with 22 √ log logN) colors. Their result is obtained by compos...