A New Algorithm for Computing Branch Number of Non-Singular Matrices over Finite Fields.
Prasanna Raghaw MishraYogesh KumarSusanta SamantaAtul GaurPublished in: CoRR (2024)
Keyphrases
- computational complexity
- times faster
- execution times
- dynamic programming
- computational effort
- homology generators
- simulated annealing
- computational cost
- significant improvement
- space complexity
- improved algorithm
- memory requirements
- learning algorithm
- detection algorithm
- optimization algorithm
- experimental evaluation
- neural network
- k means
- data sets
- clustering algorithm
- similarity measure
- objective function
- cost function
- lower bound
- input data
- expectation maximization
- theoretical analysis
- preprocessing
- optimal solution
- high accuracy
- principal component analysis
- decision trees
- small number
- finite number
- feature selection
- iterative algorithms
- genetic algorithm
- single scan