The following pages link to (Q4013534):
Displayed 6 items.
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs (Q1345961) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs (Q1897361) (← links)