Cryptographic limitations on polynomial-time posteriori query learning

DOI10.1007/978-3-319-94667-2_24MaRDI QIDQ1671013zbMATH OpenOpenAlexFDO

Authors Mikito Nanashima

Publication date 6 September 2018

Full work available at URL https://doi.org/10.1007/978-3-319-94667-2_24

zbMATH Keywords

computational learning theorycryptographyencryptionPAC learningquery learningsignature

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• Cryptographic limitations on learning Boolean formulae and finite automata
• Structural analysis of polynomial-time query learnability
• When won't membership queries help?
• scientific article; zbMATH DE number 1301787
• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

Cited in

(2)

• scientific article; zbMATH DE number 1301787 (Why is no real title available?)
• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions

This page was built for publication: Cryptographic limitations on polynomial-time posteriori query learning

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