Downloads provided by UsageCounts
A proof that a computational problem exists (defined by a continuous sample space) whose solution can be verified in time polynomial in the number of bits of the input but which cannot be solved in time polynomial in the number of bits of the input.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 21 | |
| downloads | 6 |

Views provided by UsageCounts
Downloads provided by UsageCounts