A case study in programming a quantum annealer for hard operational planning problems (Q2018131): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979392010 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1407.2887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5392885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>Colloquium</i>: Quantum annealing and analog quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all graphs with average degree 4 are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource efficient gadgets for compiling adiabatic quantum optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: STRIPS: A new approach to the application of theorem proving to problem solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for standard benchmark domains in planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limit distribution for the existence of Hamiltonian cycles in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper-bounding the \(k\)-colorability threshold by counting covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-XORSAT threshold. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minor-embedding in adiabatic quantum computation. I: The parameter setting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adiabatic quantum programming: minor embedding with hard faults / rank
 
Normal rank

Latest revision as of 22:19, 9 July 2024

scientific article
Language Label Description Also known as
English
A case study in programming a quantum annealer for hard operational planning problems
scientific article

    Statements

    A case study in programming a quantum annealer for hard operational planning problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    13 April 2015
    0 references
    quantum computation
    0 references
    quantum annealing keyword
    0 references
    operational planning
    0 references

    Identifiers