Known Algorithms for Edge Clique Cover are Probably Optimal.
Marek CyganMarcin PilipczukMichal PilipczukPublished in: SIAM J. Comput. (2016)
Keyphrases
- worst case
- learning algorithm
- recently developed
- computationally efficient
- data structure
- neural network
- binary search trees
- significant improvement
- genetic algorithm
- data sets
- upper bound
- computational complexity
- theoretical analysis
- computational efficiency
- times faster
- machine learning
- convergence rate
- efficient algorithms for computing