A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

DOI10.1007/978-3-642-02927-1_17zbMath1248.68546OpenAlexW2152927719MaRDI QIDQ3638034

Endre Boros, Kazuhisa Makino

Publication date: 14 July 2009

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

The Minimal Hitting Set Generation Problem: Algorithms and Computation ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Resolution based algorithms for the transversal hypergraph generation problem ⋮ Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs ⋮ Unnamed Item