On the complexity of binary samples
From MaRDI portal
Publication:1029587
DOI10.1007/S10472-008-9096-3zbMath1171.68016arXiv0801.4794OpenAlexW2132883151MaRDI QIDQ1029587
Publication date: 13 July 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.4794
Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05)
Cites Work
This page was built for publication: On the complexity of binary samples