Quantum property testing in sparse directed graphs
From MaRDI portal
Cites work
- A lower bound for testing 3-colorability in bounded-degree graphs
- A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
- Algorithmic and analysis techniques in property testing
- An optimal separation between two property testing models for bounded degree directed graphs
- Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
- Efficient quantum algorithms for (gapped) group testing and junta testing
- scientific article; zbMATH DE number 5899233 (Why is no real title available?)
- scientific article; zbMATH DE number 1819631 (Why is no real title available?)
- scientific article; zbMATH DE number 5568623 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 7651029 (Why is no real title available?)
- Introduction to Property Testing
- On finding quantum multi-collisions
- On testing Hamiltonicity in the bounded degree graph model
- Polynomials, quantum query complexity, and Grothendieck's inequality
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Property testing in sparse directed graphs: strong connectivity and subgraph-freeness
- Property testing. Problems and techniques
- Quantum cryptanalysis of hash and claw-free functions
- Quantum lower bound for the collision problem
- Quantum lower bounds by polynomials
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum Property Testing
- Quantum property testing for bounded-degree graphs
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Relating two property testing models for bounded degree directed graphs
- Sequential measurements, disturbance and property testing
- Strong lower bounds for approximating distribution support size and the distinct elements problem
- Sublinear time algorithms
- Sublinear-time Algorithms
- Symmetries, graph properties, and quantum speedups
- Testing \(k\)-edge-connectivity of digraphs
- Testing Eulerianity and connectivity in directed sparse graphs
- Testing properties of directed graphs: acyclicity and connectivity*
- The intersection of two halfspaces has high threshold degree
- The pattern matrix method
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
This page was built for publication: Quantum property testing in sparse directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346861)
