The following pages link to François Le Gall (Q334914):
Displaying 50 items.
- Improving quantum query complexity of Boolean matrix multiplication using graph collision (Q334915) (← links)
- Property testing for cyclic groups and beyond (Q386421) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- On the distance between non-isomorphic groups. (Q412235) (← links)
- Quantum property testing of group solvability (Q627520) (← links)
- Exponential separation of quantum and classical online space complexity (Q733715) (← links)
- Quantum algorithms for finding constant-sized sub-hypergraphs (Q896154) (← links)
- Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems (Q1660920) (← links)
- Quantum algorithm for triangle finding in sparse graphs (Q1679241) (← links)
- Quantum speedup for the minimum Steiner tree problem (Q2019462) (← links)
- Quantum query complexity of unitary operator discrimination (Q2412421) (← links)
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems (Q2701384) (← links)
- Reconstructing Strings from Substrings with Quantum Queries (Q2904573) (← links)
- (Q2906789) (← links)
- Quantum Private Information Retrieval with Sublinear Communication Complexity (Q2913816) (← links)
- Quantum Algorithms for Finding Constant-Sized Sub-hypergraphs (Q2920479) (← links)
- Fast Matrix Multiplication (Q2941553) (← links)
- Quantum Complexity of Boolean Matrix Multiplication and Related Problems (Q2944887) (← links)
- Stronger Methods of Making Quantum Interactive Proofs Perfectly Complete (Q2954372) (← links)
- Stronger methods of making quantum interactive proofs perfectly complete (Q2986882) (← links)
- An Efficient Quantum Algorithm for some Instances of the Group Isomorphism Problem (Q3113779) (← links)
- (Q3172424) (← links)
- Quantum Algorithms for Matrix Products over Semirings (Q3188907) (← links)
- Powers of tensors and fast matrix multiplication (Q3452408) (← links)
- (Q3522641) (← links)
- General Scheme for Perfect Quantum Network Coding with Free Classical Communication (Q3638068) (← links)
- (Q4601844) (← links)
- (Q4607951) (← links)
- (Q4608617) (← links)
- Generalized Quantum Arthur--Merlin Games (Q4634057) (← links)
- (Q4637980) (← links)
- A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication (Q4909580) (← links)
- (Q5002644) (← links)
- (Q5005126) (← links)
- (Q5089222) (← links)
- (Q5090500) (← links)
- (Q5091772) (← links)
- Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model (Q5145184) (← links)
- Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks (Q5197698) (← links)
- Quantum Algorithms for Matrix Products over Semirings (Q5360827) (← links)
- Triangle Finding and Listing in CONGEST Networks (Q5368990) (← links)
- (Q5390013) (← links)
- (Q5414595) (← links)
- (Q5743491) (← links)
- Quantum Weakly Nondeterministic Communication Complexity (Q5756686) (← links)
- On Distributed Listing of Cliques (Q5854055) (← links)
- (Q5874294) (← links)
- Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture (Q6083456) (← links)
- (Q6126262) (← links)
- (Q6126342) (← links)
