Compression with wildcards: Abstract simplicial complexes

DOI10.2989/16073606.2022.2071181arXiv1812.02570OpenAlexW3135857014MaRDI QIDQ6132729

Marcel Wild

Publication date: 14 July 2023

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

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

zbMATH Keywords

binary decision diagramreliability polynomialwildcardsabstract simplicial complexcompressed enumerationantitone Boolean functionexclusive sum of productsface-numberspartitionability conjecture

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05) Combinatorial aspects of simplicial complexes (05E45) Computational aspects of satisfiability (68R07)

Cites Work

• Unnamed Item
• The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
• Counting or producing all fixed cardinality transversals
• Combinatorial face enumeration in convex polytopes
• Computing the face lattice of a polytope from its vertex-facet incidences
• Compactly generating all satisfying truth assignments of a Horn formula
• Conceptual Exploration
• The Partitionability Conjecture
• The Complexity of Enumeration and Reliability Problems
• Matroids and a Reliability Analysis Problem

This page was built for publication: Compression with wildcards: Abstract simplicial complexes