3 papers
math.CO2025
Approximate polymorphisms of predicates
Yaroslav Alekseev, Yuval Filmus
A generalized polymorphism of a predicate is a tuple of functions satisfying the following property: If $x^{(1)}…
cs.CC2025
Linear Matroid Intersection is in Catalytic Logspace
Aryan Agarwala, Yaroslav Alekseev, Antoine Vinciguerra
Linear matroid intersection is an important problem in combinatorial optimization. Given two linear matroids over the same ground set, the linear matroid intersection problem asks…
cs.CC2025
Catalytic Computing and Register Programs Beyond Log-Depth
Yaroslav Alekseev, Yuval Filmus, Ian Mertz +2
In a seminal work, Buhrman et al. (STOC 2014) defined the class of problems solvable in space with an additional catalytic tape of size , which is a tape whose…