Gerhard Lischke Impossibilities and Possibilities of Weak Separation Between NP and Exponential Time. [Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1990, pp:245-253 [Conf]
Gerhard Lischke The Quality of Separation Between Polynomial Time and Exponential Time. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:10, pp:529-534 [Journal]
Gerhard Lischke Types of Separations for Relativized Complexity Classes. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1989, v:25, n:5/6, pp:255-262 [Journal]
Gerhard Lischke Flußbildmaße - Ein Versuch zur Definition natürlicher Kompliziertheitsmaße. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1975, v:11, n:7/8, pp:423-436 [Journal]
Gerhard Lischke Some Considerations about Complexity for Mazurkiewicz-algorithms. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1979, v:15, n:11, pp:549-557 [Journal]
Gerhard Lischke Relativizations of NP and EL, Strongly Separating, and Sparse Sets. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:2/3, pp:99-112 [Journal]
Gerhard Lischke Towards the Actual Relationship Between NP and Exponential Time. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 1999, v:45, n:, pp:31-49 [Journal]
Gerhard Lischke Restorations of punctured languages and similarity of languages. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2006, v:52, n:1, pp:20-28 [Journal]
Search in 0.002secs, Finished in 0.002secs
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