Learning with errors

    flowchart
    AA["Associated Authors (0)"]
    C[Learning with errors]
    BC["Broader Concepts (2)"]
    NC["Narrower Concepts (0)"]
    C== skos:broader ==>BC
    NC== skos:broader ==>C
    AA== dcterms:relation ==>C
    click BC "#broader-concepts"
    click NC "#narrower-concepts"
    click AA "#associated-authors"

    NI["add incoming edge"]
    NO["add outgoing edge"]
    NI-- ? -->C
    C-- ? -->NO
    click NI "#add-incoming-edge"
    click NO "#add-outgoing-edge"
    style NI stroke-width:2px,stroke-dasharray: 5 5
    style NO stroke-width:2px,stroke-dasharray: 5 5
Graph neighborhood for 'Learning with errors'. Click aggregate nodes to navigate.
Wikidata
https://www.wikidata.org/wiki/Q6510239
OpenAlex ID
https://openalex.org/C2779014939 (API record)
OpenAlex 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
OpenAlex Level [?]
3

Broader Concepts

Narrower Concepts

Associated Authors

Add Incoming Edge

Login via ORCiD to contribute.

Add Outgoing Edge

Login via ORCiD to contribute.