@article{lmcs:1172,
    title      = {Complexity classifications for different equivalence and audit problems for Boolean circuits},
    author     = {Elmar Böhler and Nadia Creignou and Matthias Galota and Steffen Reith and Henning Schnoor and Heribert Vollmer},
    url        = {https://lmcs.episciences.org/1172},
    doi        = {10.2168/LMCS-8(3:31)2012},
    journal    = {Logical Methods in Computer Science},
    issn       = {1860-5974},
    volume     = {Volume 8, Issue 3},
    eid        = 31,
    year       = {2012},
    month      = {Sep},
    keywords   = {Computer Science - Computational Complexity, F.2.2},
}