Some NP-complete problems for attribute reduction in consistent decision tables (Q5868044)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some NP-complete problems for attribute reduction in consistent decision tables |
scientific article; zbMATH DE number 7588018
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some NP-complete problems for attribute reduction in consistent decision tables |
scientific article; zbMATH DE number 7588018 |
Statements
Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables (English)
0 references
19 September 2022
0 references
attribute reduction
0 references
NP-completeness
0 references
computational complexity
0 references
consistent decision table
0 references
rough set theory
0 references
0.8856112957000732
0 references
0.8447431921958923
0 references
0.8441486954689026
0 references
0.8275508284568787
0 references
