Computing Boolean Functions by Polynomials and Threshold Circuits

Matthias Krause, Pavel Pudlák. Computing Boolean Functions by Polynomials and Threshold Circuits. Computational Complexity, 7(4):346-370, 1998. [doi]

@article{KrauseP98,
  title = {Computing Boolean Functions by Polynomials and Threshold Circuits},
  author = {Matthias Krause and Pavel Pudlák},
  year = {1998},
  url = {http://link.springer.de/link/service/journals/00037/bibs/8007004/80070346.htm},
  researchr = {https://researchr.org/publication/KrauseP98},
  cites = {0},
  citedby = {0},
  journal = {Computational Complexity},
  volume = {7},
  number = {4},
  pages = {346-370},
}