Theorem 5. There exists a deterministic polynomial-time algorithm that, given a finite ring R and a finite R-module M, outputs a projective cover of M.
Appears in 2 contracts
Sources: Not Applicable, Doctoral Thesis
Theorem 5. There exists a deterministic polynomial-time algorithm that, given a finite ring R and a finite R-module M, outputs a projective cover of M.
Appears in 2 contracts
Sources: Not Applicable, Doctoral Thesis