Pages that link to "Item:Q2642909"
From MaRDI portal
The following pages link to Logspace optimization problems and their approximability properties (Q2642909):
Displaying 13 items.
- Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) (← links)
- On stalling in LogP (Q557671) (← links)
- A note on logspace optimization (Q1904668) (← links)
- Approximation in (Poly-) logarithmic space (Q2037114) (← links)
- Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems (Q2867130) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- (Q3576759) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q5111278) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)