| Display title | Learning with errors |
| Default sort key | Learning with errors |
| Page length (in bytes) | 20,220 |
| Namespace ID | 0 |
| Page ID | 23864530 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of page watchers | 43 |
| Number of page watchers who visited in the last 30 days | 4 |
| Number of redirects to this page | 3 |
| Counted as a content page | Yes |
| Wikidata item ID | Q6510239 |
| Local description | Mathematical problem in cryptography |
| Central description | problem in machine learning that is conjectured to be hard to solve. Introduced by Oded Regev in 2005, it is a generalization of the parity learning problem |
| Page views in the past 30 days | |
| Edit | Allow all users (no expiry set) |
| Move | Allow all users (no expiry set) |
| Page creator | Hrushikesh Tilak (talk | contribs) |
| Date of page creation | 18:15, 4 August 2009 |
| Latest editor | Laura240406 (talk | contribs) |
| Date of latest edit | 20:25, 18 March 2025 |
| Total number of edits | 153 |
| Recent number of edits (within past 30 days) | 1 |
| Recent number of distinct authors | 1 |
| Hidden categories (7) | This page is a member of 7 hidden categories (help):
|
| Transcluded templates (60) | Pages transcluded onto the current version of this page (help):
|
| Wikidata entities used in this page | |
