## You are here

Homecounting problem

## Primary tabs

# counting problem

*counting problem*. Note that $c_{R}$ is a search problem while $\#R$ is a decision problem, however $c_{R}$ can be $\mathcal{C}$ Cook reduced to $\#R$ (for appropriate $\mathcal{C}$) using a binary search (the reason $\#R$ is defined the way it is, rather than being the graph of $c_{R}$, is to make this binary search possible).

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

68Q25*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff

## Recent Activity

Sep 28

new question: how to contest an entry? by zorba

new question: simple question by parag

Sep 26

new question: Latent variable by adam_reith

Sep 17

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag

new question: how to contest an entry? by zorba

new question: simple question by parag

Sep 26

new question: Latent variable by adam_reith

Sep 17

new question: Harshad Number by pspss

Sep 14

new problem: Geometry by parag