Learning a Bounded-Degree Tree Using Separator Queries

DOI10.1007/978-3-642-40935-6_14zbMath1405.68154OpenAlexW49832366MaRDI QIDQ2859217

M. Jagadish, Anindya Sen

Publication date: 6 November 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40935-6_14

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Exact learning of multitrees and almost-trees using path queries ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Learning a Bounded-Degree Tree Using Separator Queries