scientific article; zbMATH DE number 4060740

MaRDI QIDQ3795243zbMATH OpenFDO

Authors Alessandro D'Atri, Marina Moscarini, Antonio Sassano

Publication date 1988

zbMATH Keywords

Boolean formulaconcept classeslearnabilitynonuniform learningSteiner tree

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4060753
• Nonuniform learnability
• Results on learnability and the Vapnik-Chervonenkis dimension
• Learning in parallel
• Learnability with respect to fixed distributions

Cited in

(8)

• Weighted connected domination and Steiner trees in distance-hereditary graphs
• Nonuniform learnability
• Homogeneously orderable graphs
• Computing a metric basis of a 2-connected bipartite distance-hereditary graph
• scientific article; zbMATH DE number 4060753 (Why is no real title available?)
• On the geodeticity of the contour of a graph
• Homogeneous sets and domination problems
• Bibliography on domination in graphs and some basic definitions of domination parameters

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795243)