Monotone Dualization and Generating Hypergraph Transversals: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:2604:26, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,098 bytes −1,002‎ No edit summary undo
  • curprev 04:2504:25, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 3,100 bytes +3,100‎ Created page with "Title: Monotone Dualization and Generating Hypergraph Transversals Abstract: This research article focuses on the problem of dualizing a monotone CNF (equivalently, computing all minimal transversals of a hypergraph), which is a significant open problem in the field of NP-completeness. The authors present new polynomial time and output-polynomial time results for various significant cases, which significantly advance the tractability frontier and improve on previous res..."
Retrieved from "https://simplesci.org/wiki/Monotone_Dualization_and_Generating_Hypergraph_Transversals"