On Learning Ring-Sum-Expansions
From MaRDI portal
Recommendations
- Learning with errors over rings. (Abstract)
- Learning matrix functions over rings
- On ideal lattices and learning with errors over rings
- On ideal lattices and learning with errors over rings
- Non-commutative ring learning with errors from cyclic algebras
- Ring learning with errors: a crossroads between post-quantum cryptography, machine learning and number theory
- A neural-like network approach to finite ring computations
- Distributed Computing - IWDC 2004
- Compact ring signatures from learning with errors
- Computing on rings
Cited in
(12)- Learning fallible deterministic finite automata
- Learning counting functions with queries
- Partial observability and learnability
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
- Exploiting random walks for learning
- On PAC learning algorithms for rich Boolean function classes
- Efficiently testing sparse \(\text{GF}(2)\) polynomials
- Efficient learning with equivalence queries of conjunctions of modulo functions
- What circuit classes can be learned with non-trivial savings?
- Almost optimal proper learning and testing polynomials
- Error-free and best-fit extensions of partially defined Boolean functions
- On learning embedded midbit functions
This page was built for publication: On Learning Ring-Sum-Expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990109)
