The following pages link to José L. Balcázar (Q415620):
Displaying 50 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)
- Query Learning and Certificates in Lattices (Q3529930) (← links)
- Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules (Q3575303) (← links)
- Mining Frequent Closed Unordered Trees Through Natural Representations (Q3608751) (← links)
- Characterizing Implications of Injective Partial Orders (Q3608756) (← links)
- Canonical Horn Representations and Query Learning (Q3648750) (← links)
- Simplicity, Relativizations and Nondeterminism (Q3683534) (← links)
- Bi-immune sets for complexity classes (Q3690222) (← links)
- (Q3692867) (← links)
- Uniform characterizations of non-uniform complexity measures (Q3716297) (← links)
- (Q3740234) (← links)
- (Q3745282) (← links)
- (Q3753480) (← links)
- (Q3765251) (← links)
- Immunity and simplicity in relativizations of probabilistic complexity classes (Q3792246) (← links)
- (Q3812229) (← links)
- (Q3976035) (← links)
- (Q3996675) (← links)
- (Q4035689) (← links)
- (Q4039803) (← links)
- (Q4206394) (← links)
- (Q4281518) (← links)
- (Q4321931) (← links)
