A Note on Deterministic Poly-Time Algorithms for Partition Functions Associated with Boolean Matrices with Prescribed Row and Column Sums.
Leonid GurvitsPublished in: MFCS (2013)
Keyphrases
- theoretical analysis
- binary matrices
- orders of magnitude
- significant improvement
- data structure
- black box
- search algorithm
- computational cost
- optimization problems
- data matrix
- binary matrix
- computationally efficient
- genetic algorithm
- benchmark datasets
- clustering algorithm
- singular value decomposition
- original data
- learning algorithm