Multilinearity Can Be Exponentially Restrictive (preliminary Version)

@inproceedings{Sengupta1994MultilinearityCB,
  title={Multilinearity Can Be Exponentially Restrictive (preliminary Version)},
  author={Rimli Sengupta},
  year={1994}
}
We deene a Boolean circuit to be multilinear if the formal polynomial associated with it is multilinear as well. We consider the problem of computing the connectiv-ity function using circuits that are monotone and multilinear. Our main result is that monotone multilinear circuits for this function require exponential size. Since connectivity can be computed by monotone Boolean circuits within size O(n 3), our lower bound establishes that at least in the context of monotone computation, mul… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 17 references

The Complexity of Graph Connectivity

MFCS • 1992
View 4 Excerpts
Highly Influenced

On uniform circuit complexity

20th Annual Symposium on Foundations of Computer Science (sfcs 1979) • 1979
View 3 Excerpts
Highly Influenced

NL=poly L=poly

A. Wigderson
Proceedings of Structure in Complexity Theory, • 1994
View 1 Excerpt

Connectivity vs

M. Chrobak, H. Karlo, T. Radzik
Reachability, Information and Computation 91 • 1991
View 1 Excerpt

Monotone Separation of Logspace from NC

Structure in Complexity Theory Conference • 1991
View 2 Excerpts

Similar Papers

Loading similar papers…