An algorithmic regularity lemma for $L_p$ regular sparse matrices
Combinatorics
2017-05-19 v2
Abstract
We prove an algorithmic regularity lemma for regular matrices a class of sparse matrices which obey a natural pseudorandomness condition. This extends a result of Coja-Oghlan, Cooper and Frieze who treated the case of regular matrices. We also present applications of this result for tensors and MAX-CSP instances.
Cite
@article{arxiv.1607.07204,
title = {An algorithmic regularity lemma for $L_p$ regular sparse matrices},
author = {Thodoris Karageorgos and Silouanos Brazitikos},
journal= {arXiv preprint arXiv:1607.07204},
year = {2017}
}