Identification of partial disjunction, parity, and threshold functions

DOI10.1016/S0304-3975(99)00154-1zbMath0947.68536OpenAlexW2024028777WikidataQ127120407 ScholiaQ127120407MaRDI QIDQ1978506

Yanyan Li

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00154-1

zbMATH Keywords

RandomizationAttribute-efficient learningComplexity of Boolean functions

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (1)

Revising threshold functions

Cites Work

• Randomized vs. deterministic decision tree complexity for read-once Boolean functions
• Linear-size constant-depth polylog-threshold circuits
• Attribute-efficient learning in query and mistake-bound models
• Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
• Queries and concept learning
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Identification of partial disjunction, parity, and threshold functions