The bounded injury priority method and the learnability of unions of rectangles
type: Item
instance of: scholarly article
title: The bounded injury priority method and the learnability of unions of rectangles
zbMATH Open document ID: 0852.68079
DOI: 10.1016/0168-0072(95)00019-4
author: Zhi-Xiang Chen
author: S. Homer
published in: Annals of Pure and Applied Logic
publication date: 1996-10-13T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 03D75
zbMATH DE Number: 908459
zbMATH Keywords: finite injury priority method
zbMATH Keywords: recursion theory
zbMATH Keywords: learnability
MaRDI profile type: Publication
full work available at URL: 0168-0072(95)00019-4
OpenAlex ID: W2068895479
cites work: Queries and concept learning
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Exact Learning of Discretized Geometric Concepts
cites work: On-line learning of rectangles and unions of rectangles
cites work: Q4747544
cites work: TWO RECURSIVELY ENUMERABLE SETS OF INCOMPARABLE DEGREES OF UNSOLVABILITY (SOLUTION OF POST'S PROBLEM, 1944)
cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
cites work: Lower bound methods and separation results for on-line learning models
cites work: Algorithms and lower bounds for on-line learning of geometrical concepts
cites work: Q4845465
cites work: Q3232283
cites work: Computational limitations on learning from examples
cites work: Q4040892
cites work: A theory of the learnable
description: scientific article; zbMATH DE number 908459