Pages that link to "Item:Q1894721"
From MaRDI portal
The following pages link to Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution (Q1894721):
Displaying 11 items.
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Optimal cryptographic hardness of learning monotone functions (Q3002813) (← links)
- Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- Aggregate Pseudorandom Functions and Connections to Learning (Q5261670) (← links)
- Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (Q5892607) (← links)
- Pac-learning non-recursive Prolog clauses (Q5917441) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
