Year | DOI | Venue |
---|---|---|
1985 | 10.1137/0214003 | SIAM JOURNAL ON COMPUTING |
Keywords | Field | DocType |
np | Cook–Levin theorem,Karp–Lipton theorem,Graph,Discrete mathematics,Combinatorics,Turing completeness,Polynomial,Time complexity,Hierarchy,Mathematics,NP | Journal |
Volume | Issue | ISSN |
14 | 1 | 0097-5397 |
Citations | PageRank | References |
49 | 7.54 | 9 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ker-i Ko | 1 | 140 | 18.76 |
Uwe Schöning | 2 | 998 | 105.69 |