Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs.
Khaled ElbassioniPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- theoretical analysis
- orders of magnitude
- data structure
- computational cost
- computationally expensive
- computationally efficient
- optimization problems
- significant improvement
- computational complexity
- database
- objective function
- website
- image processing
- machine learning algorithms
- benchmark datasets
- computer vision
- classification algorithm
- computational efficiency
- machine learning