Content deleted Content added
m ISBN enable wikimagic |
|||
Line 34:
}}</ref> Note that the below referred polynomials are functions of the size of the respective functions' inputs, not the size of some implicit set of input instances.
* the size of every feasible solution is polynomially bounded,
* the languages <math>\scriptstyle \{\,x\,\mid\, x \in I \,\}</math> and <math>\scriptstyle \{\,(x,y)\, \mid\, y \in f(x) \,\}</math> can be [[decidable language|recognized]] in [[polynomial time]], and
* ''m'' is [[polynomial time|polynomial-time computable]].
| |||