Solving the generalized subset sum problem with a light based device (Q537835): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum algorithm for Hilbert's tenth problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Hamiltonian path problem with a light-based computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light-based string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact cover with light / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the subset-sum problem with a light-based device / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow sort: Sorting at the speed of light / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of analog computation / rank
 
Normal rank

Latest revision as of 02:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Solving the generalized subset sum problem with a light based device
scientific article

    Statements

    Solving the generalized subset sum problem with a light based device (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial problems
    0 references
    NP-complete problems
    0 references
    optical computing
    0 references
    0 references