Pages that link to "Item:Q5466487"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466487):
Displaying 27 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- A survey on tree matching and XML retrieval (Q394973) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Improved algorithms for quantum identification of Boolean oracles (Q884445) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- Vertices cannot be hidden from quantum spatial search for almost all random graphs (Q1654045) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Graph comparison via nonlinear quantum search (Q2105947) (← links)
- Quantum search algorithm for exceptional vertexes in regular graphs and its circuit implementation (Q2239653) (← links)
- The Exponential Time complexity of counting (quantum) graph homomorphisms (Q2301557) (← links)
- Quantum algorithm for shortest path search in directed acyclic graph (Q2314214) (← links)
- Optimal parallel quantum query algorithms (Q2408924) (← links)
- Approximate span programs (Q2414858) (← links)
- Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs (Q2920479) (← links)
- Quantum algorithms for the triangle problem (Q2921783) (← links)
- New bounds on the classical and quantum communication complexity of some graph properties (Q2957488) (← links)
- On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism (Q3068637) (← links)
- Quantum query complexity of minor-closed graph properties (Q3113728) (← links)
- Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester (Q4601846) (← links)
- Quantum Query Complexity of Minor-Closed Graph Properties (Q4910570) (← links)
- Algorithms and Computation (Q5191645) (← links)
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving (Q5885581) (← links)
- SOFSEM 2004: Theory and Practice of Computer Science (Q5902000) (← links)
- Quantum algorithm for dynamic programming approach for DAGs and applications (Q6043927) (← links)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)
- Quantum Speedups for Dynamic Programming on n-Dimensional Lattice Graphs (Q6168468) (← links)