Linear matroid intersection is in catalytic logspace
From MaRDI portal
Cites work
- A fast parallel algorithm for minimum-cost small integral flows
- A note on amortized branching program complexity
- A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
- Amortized circuit complexity, formal complexity measures, and catalytic algorithms
- Bipartite perfect matching is in quasi-NC
- Catalytic approaches to the tree evaluation problem
- Catalytic communication
- Catalytic computation
- Catalytic computing and register programs beyond log-depth
- Catalytic space: non-determinism and hierarchy
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Comments on bases in dependence structures
- Computing with a full memory: catalytic space
- Derandomizing isolation in space-bounded settings
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
- Directed planar reachability is in unambiguous log-space
- Fully characterizing lossy catalytic computation
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- scientific article; zbMATH DE number 3750968 (Why is no real title available?)
- scientific article; zbMATH DE number 1256731 (Why is no real title available?)
- scientific article; zbMATH DE number 1332669 (Why is no real title available?)
- scientific article; zbMATH DE number 3231692 (Why is no real title available?)
- scientific article; zbMATH DE number 7650313 (Why is no real title available?)
- Isolating a vertex via lattices: polytopes with totally unimodular faces
- Linear matroid intersection is in quasi-NC
- Making Nondeterminism Unambiguous
- Matching Is as Easy as the Decision Problem, in the NC Model
- Matching Theory for Combinatorial Geometries
- Matroid Intersection
- Matroid intersection algorithms
- Matroid matching and some applications
- Matroid partition
- On pure space vs catalytic space
- On the Abstract Properties of Linear Dependence
- Parallel algorithms for the assignment and minimum-cost flow problems
- Pebbles and branching programs for tree evaluation
- Quantum catalytic space
- Randomized and Symmetric Catalytic Computation
- Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
- Randomness efficient identity testing of multivariate polynomials
- Randomness-optimal unique element isolation, with applications to perfect matching and related problems
- Submodular functions, matroids, and certain polyhedra
- The dependence graph for bases in matroids
- Trading determinism for time in space bounded computations
- Trading time and space in catalytic branching programs
- TWO THEOREMS IN GRAPH THEORY
This page was built for publication: Linear matroid intersection is in catalytic logspace
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7445503)