An Elementary Description of the Oracle of Efficient Sparse Matrices
This paper proposes an elementary description of a black-box function, and proposes an heuristic optimization for this description which minimizes implementation complexity using a clique cover technique, and proves the hardness of finding such an optimal solution under the optimization framework.