
doi: 10.1007/bf00263744
An attempt is made to present a framework for the diverse complete problems that have been found. A new concept--a Hierarchy of Complete Problems is defined. Several hierarchies in various domains such as graph theory, automata theory, theorem proving and games are established.
Formal languages and automata, Algorithms in computer science, Theorem proving (deduction, resolution, etc.)
Formal languages and automata, Algorithms in computer science, Theorem proving (deduction, resolution, etc.)
| 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). | 27 | |
| 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). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
