scientific article; zbMATH DE number 1301787

MaRDI QIDQ4247003zbMATH OpenFDO

Authors Marc Fischlin

Publication date 16 June 1999

zbMATH Keywords

learning algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions
• When won't membership queries help?
• Cryptographic limitations on polynomial-time posteriori query learning
• Cryptographic limitations on learning Boolean formulae and finite automata

Cited in

(5)

• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions
• scientific article; zbMATH DE number 2080214 (Why is no real title available?)
• When won't membership queries help?
• Interactive clustering of linear classes and cryptographic lower bounds
• Cryptographic limitations on polynomial-time posteriori query learning

This page was built for publication:

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