Exact Sampling Algorithms for Latin Squares and Sudoku Matrices via Probabilistic Divide-and-Conquer.

Stephen Desalvo

Published in: Algorithmica (2017)

Keyphrases

theoretical analysis
computational cost
learning algorithm
worst case
monte carlo
brute force
sampling strategy
data sets
neural network
objective function
significant improvement
computationally efficient
orders of magnitude
uncertain data
matrix multiplication