The following pages link to Saving space by algebraization (Q2875160):
Displaying 23 items.
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Packing resizable items with application to video delivery over wireless networks (Q742419) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736) (← links)
- Efficient dissection of bicomposite problems with cryptanalytic applications (Q2010595) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Width, depth, and space: tradeoffs between branching and dynamic programming (Q2287480) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Space saving by dynamic algebraization based on tree-depth (Q2411033) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- A Pseudo-Polynomial Time Algorithm for Solving the Knapsack Problem in Polynomial Space (Q2958350) (← links)
- Planar k-Path in Subexponential Time and Polynomial Space (Q3104782) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810) (← links)
- Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q4619482) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- (Q5075820) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- (Q5743447) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
