scientific article; zbMATH DE number 7053368
From MaRDI portal
Publication:5743491
zbMath1422.68079MaRDI QIDQ5743491
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095232
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boolean and Hadamard matrices (15B34) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (5)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Improving quantum query complexity of Boolean matrix multiplication using graph collision ⋮ Fixation probabilities in evolutionary dynamics under weak selection ⋮ Quantum algorithms for finding constant-sized sub-hypergraphs ⋮ Quantum algorithm design: techniques and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast output-sensitive algorithm for Boolean matrix multiplication
- Matrix multiplication via arithmetic progressions
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- General context-free recognition in less than cubic time
- All pairs shortest distances for graphs with small integer length edges
- Complexity measures and decision tree complexity: a survey.
- Better size estimation for sparse matrix products
- Efficient determination of the transitive closure of a directed graph
- Search via Quantum Walk
- Quantum verification of matrix products
- Fast recognition of pushdown automaton and context-free languages
- Finding a Minimum Circuit in a Graph
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- All-Pairs Almost Shortest Paths
- Regularity Lemmas and Combinatorial Algorithms
- Quantum Algorithms for the Triangle Problem
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
- Quantum Walk Algorithm for Element Distinctness
- Quantum cryptanalysis of hash and claw-free functions
This page was built for publication:
