@phdthesis{Boehler2005,
  author    = {B{\"o}hler, Elmar},
  title     = {Algebraic closures in complexity theory},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-16106},
  school      = {Universit{\"a}t W{\"u}rzburg},
  year      = {2005},
  abstract  = {We use algebraic closures and structures which are derived from these in complexity theory. We classify problems with Boolean circuits and Boolean constraints according to their complexity. We transfer algebraic structures to structural complexity. We use the generation problem to classify important complexity classes.},
  subject      = {Komplexit{\"a}tstheorie},
  language  = {en}
}
@article{BoehlerCreignouGalotaetal.2012,
  author    = {B{\"o}hler, Elmar and Creignou, Nadia and Galota, Matthias and Reith, Steffen and Schnoor, Henning and Vollmer, Heribert},
  title     = {Complexity Classifications for Different Equivalence and Audit Problems for Boolean Circuits},
  series = {Logical Methods in Computer Science},
  volume    = {8},
  journal   = {Logical Methods in Computer Science},
  number    = {3:27},
  doi       = {10.2168/LMCS-8(3:27)2012},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-131121},
  pages     = {1 -- 25},
  year      = {2012},
  abstract  = {We study Boolean circuits as a representation of Boolean functions and conskier different equivalence, audit, and enumeration problems. For a number of restricted sets of gate types (bases) we obtain efficient algorithms, while for all other gate types we show these problems are at least NP-hard.},
  language  = {en}
}