Efficient methods of calculating the number of heapable permutations.
Benjamin ChenMichael ChoMario Tutuncu-MaciasTony TzolovPublished in: Discret. Appl. Math. (2023)
Keyphrases
- computationally expensive
- small number
- computational cost
- significant improvement
- databases
- computationally intensive
- information retrieval
- image processing
- preprocessing
- computational complexity
- fixed number
- dimensionality reduction
- probability distribution
- database
- search algorithm
- database systems
- case study
- genetic algorithm
- real world
- data sets