Compact DSOP and partial DSOP forms

DOI10.1007/s00224-013-9447-2zbMath1277.68084arXiv1204.5306OpenAlexW2021874124MaRDI QIDQ385501

Anna Bernasconi, Linda Pagli, Fabrizio Luccio, Valentina Ciriani

Publication date: 2 December 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

computational complexityheuristicsdisjoint sum-of-productsminimal formproduct weightsum-of-products

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table
• MINI: A Heuristic Approach for Logic Minimization
• Reducibility among Combinatorial Problems

This page was built for publication: Compact DSOP and partial DSOP forms