Elias Dahlhaus Completeness with Respect to Interpretations in Deterministic and Nondeterministic Polynomial Time. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:52-62 [Conf]

Elmar Eder A Comparison of the Resolution Caculus and the Connection Method, and a new Calculus Generalizing Both Methods. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:80-98 [Conf]

Andreas Goerdt Characterizing Complexity Classes by General Recursive Definitions in Higher Types. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:99-117 [Conf]

Erich Grädel Size of Models versus Length of Computations: On Inseparability by Nondeterministic Time Complexity Classes. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:118-137 [Conf]

Ilkka Niemelä On the Complexity of the Decision Problem in Propositional Nonmonotonic Logic. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:226-239 [Conf]

Hubert Wagener On the Emptiness Problem of Tree Automata and Completeness of Modal Logics of Programs. [Citation Graph (0, 0)][DBLP] CSL, 1988, pp:384-399 [Conf]

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