scientific article; zbMATH DE number 1301787

zbMATH Open0932.68082MaRDI QIDQ4247003FDOQ4247003

Authors: Marc Fischlin 

Publication date: 16 June 1999

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

learning algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (5)

• Title not available (Why is that?)
• Interactive clustering of linear classes and cryptographic lower bounds
• Cryptographic limitations on polynomial-time posteriori query learning
• When won't membership queries help?
• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

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)