| Title |
Gradually intractable problems and nondeterministic log-space lower bounds
|
|---|---|
| Published in |
Theory of Computing Systems, December 1985
|
| DOI | 10.1007/bf01699467 |
| Authors |
Takumi Kasai, Shigeki Iwata |
Attention Score in Context
This research output has an Altmetric Attention Score of 8. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 19 January 2017.
All research outputs
#4,821,202
of 25,374,647 outputs
Outputs from Theory of Computing Systems
#15
of 210 outputs
Outputs of similar age
#2,599
of 42,247 outputs
Outputs of similar age from Theory of Computing Systems
#1
of 4 outputs
Altmetric has tracked 25,374,647 research outputs across all sources so far. Compared to these this one has done well and is in the 80th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 210 research outputs from this source. They receive a mean Attention Score of 3.9. This one has done particularly well, scoring higher than 91% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 42,247 tracked outputs that were published within six weeks on either side of this one in any source. This one has done particularly well, scoring higher than 93% of its contemporaries.
We're also able to compare this research output to 4 others from the same source and published within six weeks on either side of this one. This one has scored higher than all of them