The following pages link to José L. Balcázar (Q415620):
Displaying 29 items.
- Construction and learnability of canonical Horn formulas (Q415621) (← links)
- Learning definite Horn formulas from closure queries (Q507524) (← links)
- Provably fast training algorithms for support vector machines (Q927401) (← links)
- (Q1051632) (redirect page) (← links)
- A note on a theorem by Ladner (Q1051633) (← links)
- (Q1085974) (redirect page) (← links)
- On bounded query machines (Q1085975) (← links)
- On \(\Delta ^ P_ 2\)-immunity (Q1087016) (← links)
- (Q1107319) (redirect page) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- Strong and robustly strong polynomial-time reducibilities to sparse sets (Q1177170) (← links)
- Logarithmic advice classes (Q1193903) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- The structure of logarithmic advice complexity classes (Q1275000) (← links)
- The query complexity of learning DFA (Q1336037) (← links)
- A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
- Sets with small generalized Kolmogorov complexity (Q1821559) (← links)
- The consistency dimension and distribution-dependent learning from queries. (Q1853513) (← links)
- Mining frequent closed rooted trees (Q1959538) (← links)
- Global optimality in \(k\)-means clustering (Q2195470) (← links)
- Self-reducibility (Q2639637) (← links)
- A general dimension for query learning (Q2641869) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices (Q3003408) (← links)
- The polynomial-time hierarchy and sparse oracles (Q3028343) (← links)
- (Q3148815) (← links)
- (Q3217603) (← links)
- (Q3217605) (← links)
- Nonuniform complexity classes specified by lower and upper bounds (Q4730777) (← links)
