If is a search problem then is the corresponding counting function and denotes the corresponding counting problem. Note that is a search problem while is a decision problem, however can be Cook reduced to (for appropriate ) using a binary search (the reason is defined the way it is, rather than being the graph of , is to make this binary search possible).
|Date of creation||2013-03-22 13:02:17|
|Last modified on||2013-03-22 13:02:17|
|Last modified by||Henry (455)|