Search Results for author:
Found 1 papers, 0 papers with code
Heuristic Algorithms for the Approximation of Mutual Coherence
Moreover, for every subset, an instance of the SAT model counting problem has to be solved which is known to be a hard problem in computer science.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
