Computing the maximal Boolean complexity of families of Aristotelian diagrams.

Published in: J. Log. Comput. (2018)

Keyphrases

computational complexity
real valued
boolean functions
information systems
evolutionary algorithm
computational cost
real time
data sets
machine learning
knowledge base
multiscale
search algorithm
software engineering
worst case