Identification of partial disjunction, parity, and threshold functions

DOI10.1016/S0304-3975(99)00154-1MaRDI QIDQ1978506zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Recommendations

• Adaptive versus nonadaptive attribute-efficient learning
• scientific article; zbMATH DE number 1775448
• Learning counting functions with queries
• On parallel attribute-efficient learning.
• scientific article; zbMATH DE number 1617283

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 4057247 (Why is no real title available?)
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• scientific article; zbMATH DE number 3209689 (Why is no real title available?)
• Attribute-efficient learning in query and mistake-bound models
• Linear-size constant-depth polylog-threshold circuits
• Optimal depth, very small size circuits for symmetric functions in \(AC^ 0\)
• Queries and concept learning
• Randomized vs. deterministic decision tree complexity for read-once Boolean functions

Cited in

(1)

• Revising threshold functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978506)