Pages that link to "Item:Q5902000"
From MaRDI portal
The following pages link to SOFSEM 2004: Theory and Practice of Computer Science (Q5902000):
Displaying 16 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- On the power of Ambainis lower bounds (Q557899) (← links)
- A query-efficient quantum algorithm for maximum matching on general graphs (Q832903) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- Graph comparison via nonlinear quantum search (Q2105947) (← links)
- The Exponential Time complexity of counting (quantum) graph homomorphisms (Q2301557) (← links)
- Quantum algorithm for shortest path search in directed acyclic graph (Q2314214) (← links)
- Evolutionary algorithms for quantum computers (Q2441596) (← links)
- Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs (Q2920479) (← links)
- On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism (Q3068637) (← links)
- Automata, Languages and Programming (Q5466487) (← links)
- Automata, Languages and Programming (Q5466532) (← 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)
- Symmetries, graph properties, and quantum speedups (Q6654557) (← links)