Analysis of Case-Based Representability of Boolean Functions by Monotone Theory

Cite

Text

Satoh. "Analysis of Case-Based Representability of Boolean Functions by Monotone Theory." International Conference on Algorithmic Learning Theory, 1998. doi:10.1007/3-540-49730-7_14

Markdown

[Satoh. "Analysis of Case-Based Representability of Boolean Functions by Monotone Theory." International Conference on Algorithmic Learning Theory, 1998.](https://mlanthology.org/alt/1998/satoh1998alt-analysis/) doi:10.1007/3-540-49730-7_14

BibTeX

@inproceedings{satoh1998alt-analysis,
  title     = {{Analysis of Case-Based Representability of Boolean Functions by Monotone Theory}},
  author    = {Satoh, Ken},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1998},
  pages     = {179-190},
  doi       = {10.1007/3-540-49730-7_14},
  url       = {https://mlanthology.org/alt/1998/satoh1998alt-analysis/}
}