Abstract
This note corrects an error that appears in the paper in the title, which appears in the Proceedings of Computing and Combinatorics, Second Annual International Conference, COCOON'96.
This research done while the author was at the Department of Computer Science, Tokyo Institute of Technology, Japan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
[BI95] J.C. Bioch and T. Ibaraki. Complexity of identification and dualization of positive Boolean funcions. Information and Computation, 123(1):50–63, 1995.
[HM91] T. Hancock and Y. Mansour. Learning kµ monotone DNF formulas on Product Distributions In Proceedings of the 4th Annual Conference on Computational, pages 179–183, 1991.
[MP97] N. Mishra and L. Pitt. Transversals of Bounded-degree Hypergraphs using Membership Queries. To appear in Proceedings of the 10th Annual ACM Conference on Computational Learning Theory, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Domingo, C. (1997). Corrigendum: Exact learning of subclasses of CDNF formulas with membership queries. In: Jiang, T., Lee, D.T. (eds) Computing and Combinatorics. COCOON 1997. Lecture Notes in Computer Science, vol 1276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0045121
Download citation
DOI: https://doi.org/10.1007/BFb0045121
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63357-0
Online ISBN: 978-3-540-69522-6
eBook Packages: Springer Book Archive