4 citations · 4 across the 5 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
cs.CC2025
Negations are powerful even in small depth
Bruno Cavalar, Théo Borém Fabris, Partha Mukhopadhyay +2
We study the power of negation in the Boolean and algebraic settings and show the following results. * We construct a family of polynomials in variables, all of whose mon…
cs.CC2025
Monotone Circuit Complexity of Matching
Bruno Cavalar, Mika Göös, Artur Riazanov +2
We show that the perfect matching function on -vertex graphs requires monotone circuits of size . This improves on the lower bound of Razbo…
cs.CC2025
Boolean Circuit Complexity and Two-Dimensional Cover Problems
Bruno P. Cavalar, Igor C. Oliveira
We reduce the problem of proving deterministic and nondeterministic Boolean circuit size lower bounds to the analysis of certain two-dimensional combinatorial cover problems. This…