Problem Reduction: Difference between revisions

From Computer Science Wiki
No edit summary
No edit summary
 
Line 3: Line 3:
Problem reduction is the process of decomposing a hard problem into easier problems. One of the fundamental aspects of knowledge is how to decompose hard problems into easier problems (given a hard problem, what is the best way to break it into pieces).  
Problem reduction is the process of decomposing a hard problem into easier problems. One of the fundamental aspects of knowledge is how to decompose hard problems into easier problems (given a hard problem, what is the best way to break it into pieces).  


When we break a problem into smaller parts, we have a sub-goal.  
When we break a problem into smaller parts, we have a sub-goal, which might be easier to solve.





Latest revision as of 06:19, 4 February 2018

Artificial Intelligence[1]

Problem reduction is the process of decomposing a hard problem into easier problems. One of the fundamental aspects of knowledge is how to decompose hard problems into easier problems (given a hard problem, what is the best way to break it into pieces).

When we break a problem into smaller parts, we have a sub-goal, which might be easier to solve.


References[edit]