Parameterized quantum query algorithms for graph problems
From MaRDI portal
Cites work
- A faster algorithm for vertex cover parameterized by solution size
- A query-efficient quantum algorithm for maximum matching on general graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An improved fixed-parameter algorithm for vertex cover
- Automata, Languages and Programming
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Combinatorial optimization. Theory and applications.
- Extended learning graphs for triangle finding
- scientific article; zbMATH DE number 6667586 (Why is no real title available?)
- scientific article; zbMATH DE number 5320343 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1304341 (Why is no real title available?)
- scientific article; zbMATH DE number 512804 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Improved quantum algorithm for triangle finding via combinatorial arguments
- Improved quantum query algorithms for triangle finding and associativity testing
- Improved upper bounds for vertex cover
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams
- Kernelization. Theory of parameterized preprocessing
- Learning graph based quantum query algorithms for finding constant-size subgraphs
- Learning-graph-based quantum algorithm for k-distinctness
- Nearly optimal communication and query complexity of bipartite matching
- Nested Quantum Walks with Quantum Data Structures
- Nondeterminism within $P^ * $
- On efficient fixed-parameter algorithms for weighted vertex cover
- Parameterized algorithms
- Parameterized and Exact Computation
- Parameterized distributed algorithms
- Parameterized Streaming: Maximal Matching and Vertex Cover
- Properties of vertex cover obstructions
- Quantum Algorithm for path-edge sampling
- Quantum algorithm for triangle finding in sparse graphs
- Quantum algorithms for connectivity and related problems
- Quantum algorithms for matching problems
- Quantum Algorithms for the Triangle Problem
- Quantum complexity of minimum cut
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
- Quantum property testing for bounded-degree graphs
- Quantum Query Complexity of Boolean Functions with Small On-Sets
- Quantum query complexity of constant-sized subgraph containment
- Quantum query complexity of minor-closed graph properties
- Quantum Query Complexity of Some Graph Problems
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Quantum speedups for exponential-time dynamic programming algorithms
- Reducibility among combinatorial problems
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- SOFSEM 2004: Theory and Practice of Computer Science
- Span programs and quantum algorithms for st-connectivity and claw detection
- Span programs for functions with constant-sized 1-certificates (extended abstract)
- Streaming kernelization
- Towards a theory of parameterized streaming algorithms
- Vertex cover: Further observations and further improvements
This page was built for publication: Parameterized quantum query algorithms for graph problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253169)
