Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 8 of 9 found articles
 
 
  Recognizing renamable generalized propositional Horn formulas is NP-complete
 
 
Title: Recognizing renamable generalized propositional Horn formulas is NP-complete
Author: Eiter, Thomas
Kilpeläinen, Pekka
Mannila, Heikki
Appeared in: Discrete applied mathematics
Paging: Volume 59 (1995) nr. 1 pages 9 p.
Year: 1995
Contents:
Publisher: Published by Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 8 of 9 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands