There exists. a deterministic polynomial-time algorithm that, given a finite ring A, computes the generalised prime subring of A. 6.2 Separability
Appears in 2 contracts
Sources: Not Applicable, Doctoral Thesis
There exists. a deterministic polynomial-time algorithm that, given a finite ring A, computes the generalised prime subring of A. 6.2 Separability
Appears in 2 contracts
Sources: Not Applicable, Doctoral Thesis