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

Search the dblp DataBase

Title:
Author:
Nikolai K. Kossovsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Nikolai K. Kossovsky
    A Chriterion of Polynominal Lower Bounds of Combinational Complexity. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:244-245 [Conf]
  2. Nikolai K. Kossovsky, Igor P. Solovjev
    Function-Patterns and Fan-Backtracking for Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 1993, pp:843- [Conf]
  3. Nikolai K. Kossovsky, A. B. Prokhoroff
    The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited. [Citation Graph (0, 0)][DBLP]
    LFCS, 1992, pp:241-245 [Conf]

Search in 0.001secs, Finished in 0.001secs
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