Quantum algorithm for triangle finding in sparse graphs (Q1679241): Difference between revisions

Latest revision as of 06:39, 28 December 2024

scientific article; zbMATH DE number 6528566

Quantum Algorithm for Triangle Finding in Sparse Graphs

Language	Label	Description	Also known as
English	Quantum algorithm for triangle finding in sparse graphs	scientific article; zbMATH DE number 6528566	Quantum Algorithm for Triangle Finding in Sparse Graphs

Statements

instance of

scholarly article

0 references

title

Quantum algorithm for triangle finding in sparse graphs (English)

0 references

Quantum Algorithm for Triangle Finding in Sparse Graphs (English)

0 references

0 references

0 references

0 references

Algorithms and Computation

0 references

publication date

9 November 2017

0 references

11 January 2016

0 references

full work available at URL

https://arxiv.org/abs/1507.06878

0 references

zbMATH Keywords

quantum algorithm

0 references

quantum walk

0 references

triangle finding

0 references

MaRDI profile type

Publication

0 references

cites work

Finding and counting given length cycles

0 references

Quantum Walk Algorithm for Element Distinctness

0 references

Quantum search with variable times

0 references

Span programs for functions with constant-sized 1-certificates

0 references

Quantum cryptanalysis of hash and claw-free functions

0 references

Quantum Algorithms for Element Distinctness

0 references

Quantum Query Complexity of Minor-Closed Graph Properties

0 references

Q4228473

0 references

Finding a Minimum Circuit in a Graph

0 references

Susceptibility in subcritical random graphs

0 references

Nested Quantum Walks with Quantum Data Structures

0 references

Improved quantum query algorithms for triangle detection and associativity testing

0 references

Quantum Algorithms for the Triangle Problem

0 references

Search via Quantum Walk

0 references

Towards polynomial lower bounds for dynamic problems

0 references

Subcubic Equivalences Between Path, Matrix, and Triangle Problems

0 references

Finding, Minimizing, and Counting Weighted Subgraphs

0 references

Identifiers

zbMATH Open document ID

1380.68188

0 references

1380.68187

0 references

DOI

10.1007/978-3-662-48971-0_50

0 references

10.1007/S00453-016-0267-Z

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1679241

@@ Property / DOI @@
-.1007/s00453-016-0267-z
@@ Property / DOI: 10.1007/s00453-016-0267-z / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S00453-016-0267-Z
@@ Property / DOI: 10.1007/S00453-016-0267-Z / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / 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 @@
+Quantum search with variable times
@@ Property / cites work: Quantum search with variable times / rank @@
+Normal rank
@@ Property / cites work @@
+Span programs for functions with constant-sized 1-certificates
+Normal rank
@@ Property / cites work @@
+Quantum cryptanalysis of hash and claw-free functions
+Normal rank
@@ Property / cites work @@
+Quantum Algorithms for Element Distinctness
@@ Property / cites work: Quantum Algorithms for Element Distinctness / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Query Complexity of Minor-Closed Graph Properties
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Minimum Circuit in a Graph
@@ Property / cites work: Finding a Minimum Circuit in a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Susceptibility in subcritical random graphs
@@ Property / cites work: Susceptibility in subcritical random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Nested Quantum Walks with Quantum Data Structures
@@ Property / cites work: Nested Quantum Walks with Quantum Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Improved quantum query algorithms for triangle detection and associativity testing
+Normal rank
@@ Property / cites work @@
+Quantum Algorithms for the Triangle Problem
@@ Property / cites work: Quantum Algorithms for the Triangle Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Search via Quantum Walk
@@ Property / cites work: Search via Quantum Walk / rank @@
+Normal rank
@@ Property / cites work @@
+Towards polynomial lower bounds for dynamic problems
+Normal rank
@@ Property / cites work @@
+Subcubic Equivalences Between Path, Matrix, and Triangle Problems
+Normal rank
@@ Property / cites work @@
+Finding, Minimizing, and Counting Weighted Subgraphs
+Normal rank