https://github.com/sueszli/optimal-tree-solver
fixed-parameter tractable (fpt) minimal decision tree solver
https://github.com/sueszli/optimal-tree-solver
geometric-algorithms parameterized-complexity
Last synced: 9 months ago
JSON representation
fixed-parameter tractable (fpt) minimal decision tree solver
- Host: GitHub
- URL: https://github.com/sueszli/optimal-tree-solver
- Owner: sueszli
- License: agpl-3.0
- Created: 2025-01-27T13:58:33.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-02-03T16:36:43.000Z (over 1 year ago)
- Last Synced: 2025-03-24T18:14:08.771Z (about 1 year ago)
- Topics: geometric-algorithms, parameterized-complexity
- Language: Python
- Homepage:
- Size: 22.4 MB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README
- License: LICENSE
Awesome Lists containing this project
README
Reproducing: Ordyniak, S., & Szeider, S. (2021). Parameterized Complexity of Small Decision Tree Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 35 (7), 6454-6462. https://www.ac.tuwien.ac.at/files/tr/ac-tr-21-002.pdf
check it out:
- report: https://sueszli.github.io/optimal-tree-solver/docs/report.pdf
- slides: https://sueszli.github.io/optimal-tree-solver/docs/slides.pdf
\/ | |/
\/ / \||/ /_/___/_
\/ |/ \/
_\__\_\ | /_____/_
\ | / /
__ _-----` |{,-----------~
\ }{
}{{
}}{
{{}
, -=-~{ .-^- _
`}
{