On the complexity of the clone membership problem

22 Sep 2020 Jeřábek Emil

We investigate the complexity of the Boolean clone membership problem (CMP): given a set of Boolean functions $F$ and a Boolean function $f$, determine if $f$ is in the clone generated by $F$, i.e., if it can be expressed by a circuit with $F$-gates. Here, $f$ and elements of $F$ are given as circuits or formulas over the usual De Morgan basis... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY
  • LOGIC IN COMPUTER SCIENCE