A 3n-Lower Bound on the Network Complexity of Boolean Functions - researchr publication bibtex

researchr

You are not signed in
Sign in
Sign up

Claus-Peter Schnorr. A 3n-Lower Bound on the Network Complexity of Boolean Functions. Theoretical Computer Science, 10:83-92, 1980.

@article{Schnorr80,
  title = {A 3n-Lower Bound on the Network Complexity of Boolean Functions},
  author = {Claus-Peter Schnorr},
  year = {1980},
  researchr = {https://researchr.org/publication/Schnorr80},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {10},
  pages = {83-92},
}

runs on WebDSL