Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions

DOI10.1134/S0965542518120102zbMath1412.68159OpenAlexW2914224662MaRDI QIDQ2420933

E. V. Djukova, Yu. I. Zhuravlev

Publication date: 7 June 2019

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotically optimal algorithmirreducible covering of Boolean matrixdualization of monotone conjunctive normal formintractable discrete problemirredundant covering of integer matrix

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Asymptotic enumeration (05A16) Matrices of integers (15B36) Boolean and Hadamard matrices (15B34)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On generating all maximal independent sets
• Asymptotically optimal dualization algorithms
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Discrete analysis of feature descriptions in recognition problems of high dimensionality

This page was built for publication: Monotone dualization problem and its generalizations: asymptotic estimates of the number of solutions