Bin Fu With Quasilinear Queries EXP Is Not Polynomial Time Turing Reducible to Sparse Sets. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:5, pp:1082-1090 [Journal]

Tao Jiang, Ming Li On the Approximation of Shortest Common Supersequences and Longest Common Subsequences. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1995, v:24, n:5, pp:1122-1139 [Journal]

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP