Polynomial Time Algorithms for Constructing Optimal Binary AIFV-2 Codes.
Mordecai J. GolinElfarouk HarbPublished in: CoRR (2020)
Keyphrases
- worst case
- computational complexity
- theoretical analysis
- computationally efficient
- finding optimal
- special case
- error correcting codes
- combinatorial optimization
- orders of magnitude
- benchmark datasets
- optimization problems
- logical operations
- greedy algorithm
- times faster
- machine learning algorithms
- data mining techniques
- data mining
- state space
- computational cost
- dynamic programming
- np hard
- evolutionary algorithm
- data structure
- decision trees
- learning algorithm