Parameterized Complexity of Small Decision Tree Learning

Ordyniak, S and Szeider, S (2021) Parameterized Complexity of Small Decision Tree Learning. In: Proceedings of the 35th AAAI Conference on Artificial Intelligence - AAAI-21 Technical Tracks 7. Thirty-Fifth AAAI Conference on Artificial Intelligence, 02-09 Feb 2021, Virtual. , pp. 6454-6462. ISBN 978-1-57735-866-4



Keywords: Computational Complexity of Reasoning
  • Accepted: 2 December 2020
  • Published (online): 18 May 2021
  • Published: 28 May 2021
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds)
Funding Information:
FunderGrant number
EPSRC (Engineering and Physical Sciences Research Council)EP/V00252X/1
Depositing User: Symplectic Publications
Date Deposited: 21 Jul 2021 14:49
Last Modified: 06 Aug 2021 10:38
Published Version:
Status: Published
Related URLs:

Download not available

A full text copy of this item is not currently available from White Rose Research Online