Subset Sum Quantumly in 1.17 n . (Q5889072): Difference between revisions

@@ label / en / label / en @@
+Subset Sum Quantumly in 1.17 n .
@@ Property / full work available at URL @@
+https://dblp.uni-trier.de/db/conf/tqc/tqc2018.html#HelmM18
+Normal rank
@@ Property / OpenAlex ID @@
+W2886122829
@@ Property / OpenAlex ID: W2886122829 / rank @@
+Normal rank
@@ Property / title @@
+Subset Sum Quantumly in 1.17 n . (English)
@@ Property / title: Subset Sum Quantumly in 1.17 n . (English) / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum walks on graphs
@@ Property / cites work: Quantum walks on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Walk Algorithm for Element Distinctness
@@ Property / cites work: Quantum Walk Algorithm for Element Distinctness / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Generic Algorithms for Hard Knapsacks
@@ Property / cites work: Improved Generic Algorithms for Hard Knapsacks / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Algorithms for the Subset-Sum Problem
@@ Property / cites work: Quantum Algorithms for the Subset-Sum Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Low Density Knapsacks
@@ Property / cites work: Solving Low Density Knapsacks / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Low-Density Subset Sum Algorithm
@@ Property / cites work: An Improved Low-Density Subset Sum Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Chosen-Ciphertext Security from Subset Sum
@@ Property / cites work: Chosen-Ciphertext Security from Subset Sum / rank @@
+Normal rank
@@ Property / cites work @@
+An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+New Generic Algorithms for Hard Knapsacks
@@ Property / cites work: New Generic Algorithms for Hard Knapsacks / rank @@
+Normal rank
@@ Property / cites work @@
+Q4266536
@@ Property / cites work: Q4266536 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving low-density subset sum problems
@@ Property / cites work: Solving low-density subset sum problems / rank @@
+Normal rank
@@ Property / cites work @@
+Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
+Normal rank
@@ Property / cites work @@
+Search via Quantum Walk
@@ Property / cites work: Search via Quantum Walk / rank @@
+Normal rank
@@ Property / cites work @@
+Q3360789
@@ Property / cites work: Q3360789 / rank @@
+Normal rank
@@ Property / cites work @@
+A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5889072