Citations of work:

Adam Kolany (1993). Satisfiability on Hypergraphs.

Order:
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  32
    Reversed Resolution in Reducing General Satisfiability Problem.Adam Kolany - 2010 - Studia Logica 95 (3):407-416.
    In the following we show that general property S considered by Cowen [1], Cowen and Kolany in [3] and earlier by Cowen in [2] and Kolany in [4] as hypergraph satisfiability, can be constructively reduced to (3, 2) · SAT , that is to satisfiability of (at most) triples with two-element forbidden sets. This is an analogue of the“classical” result on the reduction of SAT to 3 · SAT.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark