Finding Efficient Circuits for Ensemble Computation

DOI10.1007/978-3-642-31612-8_28zbMath1273.68179OpenAlexW1656143853MaRDI QIDQ2843340

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

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)

Related Items (5)

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 ⋮ Popularity-similarity random SAT formulas

Uses Software

• PrecoSAT

This page was built for publication: Finding Efficient Circuits for Ensemble Computation