On the Computational Complexity of Some Classical Equivalence Relations on Boolean Functions.
Bernd BorchertDesh RanjanFrank StephanPublished in: Theory Comput. Syst. (1998)
Keyphrases
- boolean functions
- equivalence relation
- computational complexity
- uniform distribution
- rough set theory
- rough sets
- dnf formulae
- rough set approximations
- numerical data
- functional properties
- np complete
- granular computing
- multi valued
- decision problems
- categorical data
- random graphs
- membership queries
- data sets
- situation calculus
- np hard
- special case
- databases