The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Paper info

Kevin J. Compton, C. Ward Henson
A Uniform Method for Proving Lower Bounds on the Computational Complexity of Logical Theories. [Citation Graph (2, 0)][DBLP]
Ann. Pure Appl. Logic, 1990, v:48, n:1, pp:1-79 [Journal]

Scores and Rank
SCEAS: 0.55074
SCEAS_PS: 0.01046
SCEAS_BPS: 0.04114
SCEAS_EPS: 0.03070
SCEAS_BEPS: 0.12413
SCEAS_B0: 3.24194
PAGE_RANK: 0.53568
HITS_H: 0
HITS_A: 0.04004
BHITS_H: 0
BHITS_A: 0.00038
SALSA_A: 0.33113
SALSA_H: 0
BSALSA_A: 0.08884
BSALSA_H: 0
P: 0
BCC: 0.17722
citations_to_me: 2
citations_from_me: 0



Graph produced by graphviz-1.8.5
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:
Level:
Show on graph: DBLP citations: Citations Imported from Citeseer:

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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002