3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.DS2026
Thin matrix products up to D <= N^0.172 and lossless reductions for 3SUM, Exact Triangle and APSP, with 3SUM over abelian groups and a dichotomy for coordinatewise problems
Ruhollah Majdoddin
Alman and Vassilevska Williams (arXiv:2610.06783) gave the first polynomial improvements over the textbook algorithms for 3SUM and APSP: deterministic algorithms with exponents 1.9…
cs.CC2018
Uniform CSP Parameterized by Solution Size is in W[1]
Ruhollah Majdoddin
We show that the uniform Constraint Satisfaction Problem (CSP) parameterized by the size of the solution is in W[1] (the problem is W[1]-hard and it is easy to place it in W[3]). G…
cs.CC2017★ 3 cited
Parameterized Complexity of CSP for Infinite Constraint Languages
Ruhollah Majdoddin
We study parameterized Constraint Satisfaction Problem for infinite constraint languages. The parameters that we study are weight of the satisfying assignment, number of constraint…