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

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