1.Previous
3.Next

integer n, count the number of nontrivial prime factors of n."

A counting problem can be represented by a function f from {0, 1}^* to the nonnegative integers. For a search relation R, the counting problem associated to R is the function

:f_R(x) = |{y: R(x, y) }|.

Optimization problem

An optimization problem asks for finding a "best possible" solution among the set of all possible solutions to a search problem. One example is the maximum independent

1.Previous
3.Next