Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs

DOI10.1007/978-3-319-08783-2_37MaRDI QIDQ2920479zbMATH OpenOpenAlexFDO

Authors François Le Gall, Harumichi Nishimura, Seiichiro Tani

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08783-2_37

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Quantum algorithms and complexity in the theory of computing (68Q12) Hypergraphs (05C65)

Recommendations

• Quantum algorithms for finding constant-sized sub-hypergraphs
• Quantum query complexity of constant-sized subgraph containment
• Learning graph based quantum query algorithms for finding constant-size subgraphs
• scientific article; zbMATH DE number 5320343
• Quantum solutions for densest \(k\)-subgraph problems
• Quantum algorithms for the subset-sum problem
• Quantum query complexity of subgraph isomorphism and homomorphism
• Quantum Query Complexity of Some Graph Problems
• Automata, Languages and Programming
• SOFSEM 2004: Theory and Practice of Computer Science

Cited in

(3)

• Quantum algorithms for finding constant-sized sub-hypergraphs
• Computing hypergraph Ramsey numbers by using quantum circuit
• scientific article; zbMATH DE number 5320343 (Why is no real title available?)

This page was built for publication: Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2920479)