30 citations · 32 across the 3 of their papers we have counts for
3 papers
cs.CC2023
The communication complexity of functions with large outputs
Lila Fontes, Sophie Laplante, Mathieu Lauriere +1
We study the two-party communication complexity of functions with large outputs, and show that the communication complexity can greatly vary depending on what output model is consi…
cs.LO2011★ 30 cited
Formal Theories for Linear Algebra
Stephen A Cook, Lila A Fontes
We introduce two-sorted theories in the style of [CN10] for the complexity classes \oplusL and DET, whose complete problems include determinants over Z2 and Z, respectively. We the…
cs.LO2010★ 2 cited
Formal Theories for Logspace Counting
Lila Fontes
We introduce two-sorted theories in the style of Cook and Nguyen for the complexity classes ParityL and DET, whose complete problems include determinants over GF(2) and Z, respecti…