Complexity classifications for different equivalence and audit problems for Boolean circuits
From MaRDI portal
Publication:3166221
DOI10.2168/LMCS-8(3:31)2012zbMath1248.94130arXiv1009.1208MaRDI QIDQ3166221
Nadia Creignou, Matthias Galota, Heribert Vollmer, Elmar Böhler, Henning Schnoor, Steffen Reith
Publication date: 22 October 2012
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.1208
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Parametrised Complexity of Satisfiability in Temporal Logic ⋮ The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs ⋮ The Weight in Enumeration
This page was built for publication: Complexity classifications for different equivalence and audit problems for Boolean circuits
