Almost-everywhere superiority for quantum polynomial time (Q1854537): Difference between revisions

@@ Property / cites work @@
+Almost-everywhere complexity hierarchies for nondeterministic time
+Normal rank
@@ Property / cites work @@
+Q4501528
@@ Property / cites work: Q4501528 / rank @@
+Normal rank
@@ Property / cites work @@
+Relative to a Random Oracle<i>A</i>, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1
+Normal rank
@@ Property / cites work @@
+Oracle Quantum Computing
@@ Property / cites work: Oracle Quantum Computing / rank @@
+Normal rank
@@ Property / cites work @@
+A note on almost-everywhere-complex sets and separating deterministic- time-complexity classes
+Normal rank
@@ Property / cites work @@
+Q3760533
@@ Property / cites work: Q3760533 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost-everywhere superiority for quantum polynomial time
+Normal rank
@@ Property / cites work @@
+Q4249527
@@ Property / cites work: Q4249527 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential separation of quantum and classical communication complexity
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+On the Power of Quantum Computation
@@ Property / cites work: On the Power of Quantum Computation / rank @@
+Normal rank