Identification of partial disjunction, parity, and threshold functions

DOI10.1016/S0304-3975(99)00154-1zbMATH Open0947.68536OpenAlexW2024028777WikidataQ127120407 ScholiaQ127120407MaRDI QIDQ1978506FDOQ1978506

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

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

zbMATH Keywords

RandomizationAttribute-efficient learningComplexity of Boolean functions

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Cites Work

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

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)