Matroid Horn functions

DOI10.1016/j.jcta.2023.105838zbMath1530.05021arXiv2301.06642MaRDI QIDQ6187338

Kazuhisa Makino, Endre Boros, Kristóf Bérczi

Publication date: 15 January 2024

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.06642

zbMATH Keywords

matroidsBoolean minimizationHorn functionsTurán systems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Minimal coverings of pairs by triples
• Covering triples by quadruples: an asymptotic solution
• The minimum equivalent DNF problem and shortest implicants
• Computing intersections of Horn theories for reasoning with models
• Counting designs
• Horn approximations of empirical data
• What we know and what we do not know about Turán numbers
• On coverings
• Reasoning with models
• Disjunctions of Horn Theories and Their Cores
• The complexity of theorem-proving procedures
• The decision problem for some classes of sentences without quantifiers
• Approximating Minimum Representations of Key Horn Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matroid Horn functions