A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
The exponential complexity of the satisfiability problem for a given class of Boolean circuits is defined to be the infimum of constants α such that the problem can be solved in time poly(m) 2 αn , where m is the circuit size and n is the number of input variables [IP01]. We consider satisfiability of linear Boolean formula over the full binary basis and we show that the corresponding exponential complexities are "interwoven" with those of k-CNF SAT in the following sense. For any constant c,doi:10.1007/978-3-642-38233-8_10 fatcat:ritdjkikvbfvzgic4aiymzqere