Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
Formula Size-Depth Tradeoffs for Iterated Sub-Permutation Matrix Multiplication
Benjamin Rossman
We study the formula complexity of Iterated Sub-Permutation Matrix Multiplication, the logspace-complete problem of computing the product of -by- Boolean matrices with at…
cs.CC2016
An Improved Homomorphism Preservation Theorem From Lower Bounds in Circuit Complexity
Benjamin Rossman
Previous work of the author [39] showed that the Homomorphism Preservation Theorem of classical model theory remains valid when its statement is restricted to finite structures. In…