Abstract: In the sparse polynomial multiplication problem, one is asked to multiply two sparse polynomials f and g in time that is proportional to the size of the input plus the size of the output.
Abstract: General sparse matrix-matrix multiplication (SpGEMM) is a fundamental computational method with wide-ranging applications in scientific simulations, machine learning, and image processing.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results