A pretty complete combinatorial algorithm for the threshold synthesis problem

DOI10.1007/978-3-642-45278-9_43MaRDI QIDQ2870060zbMATH OpenOpenAlexFDO

Authors Christian Schilling, Jan-Georg Smaus, Fabian Wenzelmann

Publication date 17 January 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45278-9_43

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint
• Realization of boolean functions using threshold elements
• scientific article; zbMATH DE number 850396
• Pseudo-Boolean optimization with a disjunctive constraint
• scientific article; zbMATH DE number 1182572

Cited in

(2)

• Polynomial-time algorithms for regular set-covering and threshold synthesis
• On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint

This page was built for publication: A pretty complete combinatorial algorithm for the threshold synthesis problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870060)