On the power of non-adaptive learning graphs (Q488054): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q12 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 81P68 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6390110 / rank
 
Normal rank
Property / zbMATH Keywords
 
quantum computing
Property / zbMATH Keywords: quantum computing / rank
 
Normal rank
Property / zbMATH Keywords
 
query algorithms
Property / zbMATH Keywords: query algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
adversary method
Property / zbMATH Keywords: adversary method / rank
 
Normal rank
Property / zbMATH Keywords
 
\(k\)-sum problem
Property / zbMATH Keywords: \(k\)-sum problem / rank
 
Normal rank
Property / zbMATH Keywords
 
triangle problem
Property / zbMATH Keywords: triangle problem / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite optimization
Property / zbMATH Keywords: semidefinite optimization / rank
 
Normal rank

Revision as of 21:02, 30 June 2023

scientific article
Language Label Description Also known as
English
On the power of non-adaptive learning graphs
scientific article

    Statements

    On the power of non-adaptive learning graphs (English)
    0 references
    0 references
    0 references
    23 January 2015
    0 references
    quantum computing
    0 references
    query algorithms
    0 references
    adversary method
    0 references
    \(k\)-sum problem
    0 references
    triangle problem
    0 references
    semidefinite optimization
    0 references

    Identifiers