Theorem 5. There exists a deterministic polynomial-time algorithm that, given a finite ring R and two finite R-modules M and N, one of which is projective, deter- mines whether there exists a surjection M → N. If one exists, the algorithm exhibits one such.
Appears in 2 contracts
Sources: Not Applicable, Doctoral Thesis