Search dblp for Publications

export results for "Properly Learning Decision Trees with Queries Is NP-Hard."

 download as .bib file

@inproceedings{DBLP:conf/focs/KochST23,
  author       = {Caleb Koch and
                  Carmen Strassle and
                  Li{-}Yang Tan},
  title        = {Properly learning decision trees with queries is NP-hard},
  booktitle    = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2023, Santa Cruz, CA, USA, November 6-9, 2023},
  pages        = {2383--2407},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/FOCS57990.2023.00146},
  doi          = {10.1109/FOCS57990.2023.00146},
  timestamp    = {Thu, 05 Sep 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/focs/KochST23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2307-04093,
  author       = {Caleb Koch and
                  Carmen Strassle and
                  Li{-}Yang Tan},
  title        = {Properly Learning Decision Trees with Queries Is NP-Hard},
  journal      = {CoRR},
  volume       = {abs/2307.04093},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2307.04093},
  doi          = {10.48550/ARXIV.2307.04093},
  eprinttype    = {arXiv},
  eprint       = {2307.04093},
  timestamp    = {Thu, 05 Sep 2024 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2307-04093.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}