论文信息 - Linear Transformations in Boolean Complexity Theory

Linear Transformations in Boolean Complexity Theory

We attempt to understand a cohomological approach to lower bounds in Boolean circuits (of [Fri05]) by studying a very restricted case; in this case Boolean complexity is described via the kernel (or nullspace) of a fairly simple linear transformation and its transpose. We look at this linear transformation approach for Boolean functions where we only allow AND gates, which is essentially the SET COVER problem. These linear transformations can recover the linear programming bound. More importantly, we learn that the optimal linear transformation to use can depend on the Boolean function whose complexity we wish to bound; we also learn that infinite complexity (that can occur in AND complexity over arbitrary sets and "bases") appears as a limits of the linear transformation bounds.

Joel Friedman

[1] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2] J. Michael Steele,et al. Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.

[3] Bodo Manthey,et al. Approximability of Minimum AND-Circuits , 2006, SWAT.

[4] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.

[5] Ingo Wegener,et al. The complexity of Boolean functions , 1987 .

[6] Joel Friedman,et al. Cohomology in Grothendieck Topologies and Lower Bounds in Boolean Complexity II: A Simple Example , 2005, ArXiv.

[7] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..

[8] Stephen Smale,et al. On the topology of algorithms, I , 1987, J. Complex..