Dualization problem over the product of chains: asymptotic estimates for the number of solutions

DOI10.1134/S1064562418070086zbMath1485.68167OpenAlexW2910707617MaRDI QIDQ1732054

Xianqiang Yang

Publication date: 15 March 2019

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562418070086

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Boolean functions (06E30) Total orders (06A05) Boolean and Hadamard matrices (15B34)

Related Items (2)

One approach to decoding monotone logical function ⋮ On the logical analysis of partially ordered data in the supervised classification problem

Cites Work

• Unnamed Item
• On generating all maximal independent sets
• Asymptotically optimal dualization algorithms
• Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms

This page was built for publication: Dualization problem over the product of chains: asymptotic estimates for the number of solutions