Authors: E A Potseluevskaya
Publish Date: 2012/05/03
Volume: 183, Issue: 3, Pages: 407-412
Abstract
We consider an algorithm for transferring Boolean functions to function classes for which the generalized satisfiability problem is solvable in polynomial time Schaefer’s classes For the case where an initial function is represented as a truthtable it is proved that the complexity of the algorithm is l2 + llog 22l where l is the input length
Keywords: