Pages that link to "Item:Q5248506"

The following pages link to Cryptographic hardness of distribution-specific learning (Q5248506):

Displaying 23 items.

• Learning intersections and thresholds of halfspaces (Q598257) (← links)
• Optimally learning social networks with activations and suppressions (Q982645) (← links)
• Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
• Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
• Learning with queries corrupted by classification noise (Q1304475) (← links)
• An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530) (← links)
• Learning orthogonal F-Horn formulas (Q1390949) (← links)
• On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
• Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
• Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
• On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
• The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
• The complexity of properly learning simple concept classes (Q2462500) (← links)
• Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
• Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
• Learning DNF from random walks (Q2568457) (← links)
• Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
• Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
• Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
• On ε‐biased generators in NC⁰ (Q5486308) (← links)
• Learning a circuit by injecting values (Q5920703) (← links)
• Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)
• Is ML-based cryptanalysis inherently limited? Simulating cryptographic adversaries via gradient-based methods (Q6652981) (← links)