Comparative complexity of quantum and classical OBDDs for total and partial functions (Q906414): Difference between revisions

@@ Property / cites work @@
+Q3924153
@@ Property / cites work: Q3924153 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2706552
@@ Property / cites work: Q2706552 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782697
@@ Property / cites work: Q4782697 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Q2766857
@@ Property / cites work: Q2766857 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum branching programs and space-bounded nonuniform quantum complexity
+Normal rank
@@ Property / cites work @@
+Q4809601
@@ Property / cites work: Q4809601 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational power of probabilistic and quantum branching program
+Normal rank
@@ Property / cites work @@
+Q3339244
@@ Property / cites work: Q3339244 / rank @@
+Normal rank
@@ Property / cites work @@
+Superiority of exact quantum automata for promise problems
+Normal rank
@@ Property / cites work @@
+Q3262596
@@ Property / cites work: Q3262596 / rank @@
+Normal rank