Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any

Cite

Text

Nock. "Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any." International Conference on Algorithmic Learning Theory, 1999. doi:10.1007/3-540-46769-6_15

Markdown

[Nock. "Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any." International Conference on Algorithmic Learning Theory, 1999.](https://mlanthology.org/alt/1999/nock1999alt-complexity/) doi:10.1007/3-540-46769-6_15

BibTeX

@inproceedings{nock1999alt-complexity,
  title     = {{Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any}},
  author    = {Nock, Richard},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {1999},
  pages     = {182-193},
  doi       = {10.1007/3-540-46769-6_15},
  url       = {https://mlanthology.org/alt/1999/nock1999alt-complexity/}
}