Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation

Schweitzer. "Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation." Annual Conference on Computational Learning Theory, 1988.

[Schweitzer. "Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation." Annual Conference on Computational Learning Theory, 1988.](https://mlanthology.org/colt/1988/schweitzer1988colt-non/)

@inproceedings{schweitzer1988colt-non,
  title     = {{Non-Learnable Classes of Boolean Formulae That Are Closer Under Variable Permutation}},
  author    = {Schweitzer, Haim},
  booktitle = {Annual Conference on Computational Learning Theory},
  year      = {1988},
  pages     = {155-166},
  url       = {https://mlanthology.org/colt/1988/schweitzer1988colt-non/}
}