Linear matroid intersection is solvable in catalytic logspace with polynomial time, the hardest problem yet known to lie in the class CL.
Derandomizing the isolation lemma and lower bounds for circuit size
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Linear Matroid Intersection is in Catalytic Logspace
Linear matroid intersection is solvable in catalytic logspace with polynomial time, the hardest problem yet known to lie in the class CL.