Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-031-20643-6_22
+Normal rank
@@ Property / OpenAlex ID @@
+W4312791883
@@ Property / OpenAlex ID: W4312791883 / rank @@
+Normal rank
@@ Property / cites work @@
+Regular Languages meet Prefix Sorting
@@ Property / cites work: Regular Languages meet Prefix Sorting / rank @@
+Normal rank
@@ Property / cites work @@
+Pattern Matching in Hypertext
@@ Property / cites work: Pattern Matching in Hypertext / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Query Complexity of Some Graph Problems
@@ Property / cites work: Quantum Query Complexity of Some Graph Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q5091210
@@ Property / cites work: Q5091210 / rank @@
+Normal rank
@@ Property / cites work @@
+Wheeler graphs: a framework for BWT-based data structures
+Normal rank
@@ Property / cites work @@
+On the Hardness and Inapproximability of Recognizing Wheeler Graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of recognizing Wheeler graphs
@@ Property / cites work: On the complexity of recognizing Wheeler graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of approximate pattern matching on de Bruijn graphs
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4496240
@@ Property / cites work: Q4496240 / rank @@
+Normal rank
@@ Property / cites work @@
+String matching in \(\tilde O(\sqrt n+\sqrt m)\) quantum time
+Normal rank
@@ Property / cites work @@
+Search via Quantum Walk
@@ Property / cites work: Search via Quantum Walk / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximate pattern matching on hypertext
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6111593