Complexity theoretic hardness results for query learning
type: Item
instance of: scholarly article
title: Complexity theoretic hardness results for query learning
zbMATH Open document ID: 0903.68157
DOI: 10.1007/PL00001593
author: Howard Aizenstein
author: Tibor Hegedűs
author: Lisa Hellerstein
author: Leonard Pitt
published in: Computational Complexity
publication date: 1998-10-26T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 1197105
zbMATH Keywords: learning algorithm
zbMATH Keywords: representation problem
MaRDI profile type: Publication
full work available at URL: pl00001593
OpenAlex ID: W2072682576
description: scientific article; zbMATH DE number 1197105