2.2. The Estimation of Computational Complexity
The aim of this section is to estimate the computational complexity, based on the mathematical model presented in Chapter 1, when the multi-granular computing is used (Zhang and Zhang, 1990d, 1992).
2.2.1. The Assumptions
A problem space is assumed to be a finite set. Symbol 
denotes the number of elements in X. Sometimes, we simply use X instead of 
if no confusion is made.
denotes the number of elements in X. Sometimes, we simply use X instead of if no confusion is made.If we solve the problem X directly, i.e., finding a goal in X, the computational complexity is assumed to be . Then, the complexity ...
Get Quotient Space Based Problem Solving now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
