Finding efficient circuits for ensemble computation

DOI10.1007/978-3-642-31612-8_28MaRDI QIDQ2843340zbMATH OpenOpenAlexFDO

Authors Matti Järvisalo, Petteri Kaski, Mikko Koivisto, Janne H. Korhonen

Publication date 12 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31612-8_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 1962894
• Minimal sets on propositional formulae. Problems and reductions
• Approximability of Minimum AND-Circuits
• The conjunctive complexity of quadratic Boolean functions
• ON GENERIC NP-COMPLETENESS OF THE PROBLEM OF BOOLEAN CIRCUITS SATISFIABILITY

Cited in

(5)

• Popularity-similarity random SAT formulas
• Separating OR, SUM, and XOR circuits
• Generating SAT instances with community structure
• Fast Möbius inversion in semimodular lattices and ER-labelable posets
• Synchronous counting and computational algorithm design

Describes a project that uses

Uses Software

• PrecoSAT

This page was built for publication: Finding efficient circuits for ensemble computation

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