An efficient algorithm for Pawlak reduction based on simplified discernibility matrix

From MaRDI portal
(Redirected from An efficient algorithm for Pawlak reduction based on simplified discernibility matrix)
An efficient algorithm for Pawlak reduction based on simplified discernibility matrix (scientific article; zbMATH DE number 5859631)















This page was built for publication: An efficient algorithm for Pawlak reduction based on simplified discernibility matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079440)