Content deleted Content added
m Corrected the series attribute of a reference. |
|||
Line 34:
| publisher = Springer
| isbn = ISBN-13 978-3540441342
}}</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>I</math> and <math>f(x)</math> can be [[decidable language | recognized]] in [[polynomial time]], and
|