# Blackboard for Problem Solving with C++

The Standards for Mathematical Practice describe varieties of expertise that mathematics educators at all levels should seek to develop in their students. These practices rest on important “processes and proficiencies” with longstanding importance in mathematics education. The first of these are the NCTM process standards of problem solving, reasoning and proof, communication, representation, and connections. The second are the strands of mathematical proficiency specified in the National Research Council’s report : adaptive reasoning, strategic competence, conceptual understanding (comprehension of mathematical concepts, operations and relations), procedural fluency (skill in carrying out procedures flexibly, accurately, efficiently and appropriately), and productive disposition (habitual inclination to see mathematics as sensible, useful, and worthwhile, coupled with a belief in diligence and one’s own efficacy).

## Code Listing for Problem Solving with C++

Photo provided by Flickr

### Test Bank for Problem Solving with C++

However, in order to be useful, reductions must be . For example, it's quite possible to reduce a difficult-to-solve problem like the to a trivial problem, like determining if a number equals zero, by having the reduction machine solve the problem in exponential time and output zero only if there is a solution. However, this does not achieve much, because even though we can solve the new problem, performing the reduction is just as hard as solving the old problem. Likewise, a reduction computing a can reduce an to a decidable one. As Michael Sipser points out in : "The reduction must be easy, relative to the complexity of typical problems in the class [...] If the reduction itself were difficult to compute, an easy solution to the complete problem wouldn't necessarily yield an easy solution to the problems reducing to it."

### Test Generator for Problem Solving with C++

Therefore, the appropriate notion of reduction depends on the complexity class being studied. When studying the complexity class and harder classes such as the , are used. When studying classes within P such as and , are used. Reductions are also used in to show whether problems are or are not solvable by machines at all; in this case, reductions are restricted only to .

Photo provided by Flickr