Hardness of learning problems over Burnside groups of exponent 3 (Q2339133): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10623-013-9892-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1970144139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hiding information from an oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Learning in Presence of Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random oracles separate PSPACE from the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Learning Problems and Applications to Non-commutative Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise-tolerant learning, the parity problem, and the statistical query model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing programs that check their work / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Knowledge Complexity of Interactive Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3253828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient noise-tolerant learning from statistical queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Ideal Lattices and Learning with Errors over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank

Latest revision as of 22:46, 9 July 2024

scientific article
Language Label Description Also known as
English
Hardness of learning problems over Burnside groups of exponent 3
scientific article

    Statements

    Hardness of learning problems over Burnside groups of exponent 3 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    learning with errors
    0 references
    post-quantum cryptography
    0 references
    non-commutative cryptography
    0 references
    Burnside groups
    0 references
    random self-reducibility
    0 references
    0 references