Bruno Pasqualotto Cavalar

Bruno Pasqualotto Cavalar

Auto-generated profile, based on publicly available information

Bruno Pasqualotto Cavalar

University of Oxford, Oxford, United Kingdom

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 July 2022 in Algorithmica
Verified
Journal Article
Open access
PDF file
BCBruno Pasqualotto Cavalar
Bruno Pasqualotto Cavalar
MKMrinal Kumar
Mrinal Kumar
BRBenjamin Rossman
Benjamin Rossman
Robust sunflowers are a generalization of combinatorial sunflowers that have applications in monotone circuit complexity Rossman (SIAM J. Comput. 43:256–279, 2014), DNF sparsification Gopalan et al. (Comput. Complex. 22:275–310 2013), randomness extractors Li et al. (In: APPROX-RANDOM, LIPIcs 116:51:1–13, 2018), and recent advances on the Erdős-Rado sunflower conjecture Alweiss et al. (In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC. Association for Computing Machinery, New York, NY, USA, 2020) Lovett et al. (From dnf compression to sunflower theorems via regularity, 2019) Rao (Discrete Anal. 8,2020). The recent breakthrough of Alweiss, Lovett, Wu and Zhang Alweiss et al. (In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC. Association for Computing Machinery, New York, NY, USA, 2020) gives an improved bound on the maximum size of a w-set system that excludes a robust sunflower. In this paper, we use this result to obtain an $$\exp (n^{1/2-o(1)})$$ exp ( n 1 / 2 - o ( 1 ) ) lower bound on the monotone circuit size of an explicit n-variate monotone function, improving the previous best known $$\exp (n^{1/3-o(1)})$$ exp ( n 1 / 3 - o ( 1 ) ) due to Andreev (Algebra and Logic, 26:1–18, 1987) and Harnik and Raz (In: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, ACM, New York, 2000). We also show an $$\exp (\varOmega (n))$$ exp ( Ω ( n ) ) lower bound on the monotone arithmetic circuit size of a related polynomial via a very simple proof. Finally, we introduce a notion of robust clique-sunflowers and use this to prove an $$n^{\varOmega (k)}$$ n Ω ( k ) lower bound on the monotone circuit size of the CLIQUE function for all $$k \leqslant n^{1/3-o(1)}$$ k ⩽ n 1 / 3 - o ( 1 ) , strengthening the bound of Alon and Boppana (Combinatorica, 7:1–22, 1987).

1 January 2021 in SIAM Journal on Discrete Mathematics
Verified
Journal Article
Closed access
GBGabriel Ferreira Barros
Gabriel Ferreira Barros
BCBruno Pasqualotto Cavalar
Bruno Pasqualotto Cavalar
YKYoshiharu Kohayakawa
Yoshiharu Kohayakawa
TNTássio Naia
Tássio Naia
If $G$ is a graph and $\vec H$ is an oriented graph, we write $G\to \vec H$ to say that every orientation of the edges of $G$ contains $\vec H$ as a subdigraph. We consider the case in which $G$ is the binomial random graph $G(n,p)$, establishing the threshold $p_{\vec H}=p_{\vec H}(n)$ for the property $G(n,p)\to \vec H$ for the cases in which $\vec H$ is an acyclic orientation of a complete graph or of a cycle.

28 April 2025
Verified
Book Chapter
Closed access
PDF file
BCBruno P. Cavalar
Bruno P. Cavalar
EGEli Goldin
Eli Goldin
MGMatthew Gray
Matthew Gray
PHPeter Hall
Peter Hall

9 June 2026
Verified
Conference Paper
Open access
BCBruno Cavalar
Bruno Cavalar
BCBoyang Chen
Boyang Chen
ACAndrea Coladangelo
Andrea Coladangelo
MGMatthew Gray
Matthew Gray
ZHZihan Hu
Zihan Hu
XLXingjian Li
Xingjian Li
We give a meta-complexity characterization of EFI pairs, which are considered the “minimal” primitive in quantum cryptography (and are equivalent to quantum commitments). More precisely, we show that the existence of EFI pairs is equivalent to the following: there exists a non-uniformly samplable distribution over pure states such that the problem of estimating a certain Kolmogorov-like complexity measure is hard given a single copy. A key technical step in our proof, which may be of independent interest, is to show that the existence of EFI pairs is equivalent to the existence of non-uniform single-copy secure pseudorandom state generators (nu 1-PRS). As a corollary, we get an alternative, arguably simpler, construction of a universal EFI pair.

18 March 2025 in arXiv
Verified
Preprint
Open access
PDF file
BCBruno P. Cavalar
Bruno P. Cavalar
IOIgor C. Oliveira
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 is obtained by combining results of Razborov (1989), Karchmer (1993), and Wigderson (1993) in the context of the fusion method for circuit lower bounds with the graph complexity framework of Pudlák, Rödl, and Savický (1988). For convenience, we formalize these ideas in the more general setting of "discrete complexity", i.e., the natural set-theoretic formulation of circuit complexity, variants of communication complexity, graph complexity, and other measures. We show that random graphs have linear graph cover complexity, and that explicit super-logarithmic graph cover complexity lower bounds would have significant consequences in circuit complexity. We then use discrete complexity, the fusion method, and a result of Karchmer and Wigderson (1993) to introduce nondeterministic graph complexity. This allows us to establish a connection between graph complexity and nondeterministic circuit complexity. Finally, complementing these results, we describe an exact characterization of the power of the fusion method in discrete complexity. This is obtained via an adaptation of a result of Nakayama and Maruoka (1995) that connects the fusion method to the complexity of "cyclic" Boolean circuits, which generalize the computation of a circuit by allowing cycles in its specification.

11 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
BCBruno P. Cavalar
Bruno P. Cavalar
IOIgor C. Oliveira
Igor C. Oliveira
We establish new separations between the power of monotone and general (non-monotone) Boolean circuits: - For every $k \geq 1$, there is a monotone function in ${\sf AC^0}$ that requires monotone circuits of depth $Ω(\log^k n)$. This significantly extends a classical result of Okol'nishnikova (1982) and Ajtai and Gurevich (1987). In addition, our separation holds for a monotone graph property, which was unknown even in the context of ${\sf AC^0}$ versus ${\sf mAC^0}$. - For every $k \geq 1$, there is a monotone function in ${\sf AC^0}[\oplus]$ that requires monotone circuits of size $\exp(Ω(\log^k n))$. This makes progress towards a question posed by Grigni and Sipser (1992). These results show that constant-depth circuits can be more efficient than monotone circuits when computing monotone functions. In the opposite direction, we observe that non-trivial simulations are possible in the absence of parity gates: every monotone function computed by an ${\sf AC^0}$ circuit of size $s$ and depth $d$ can be computed by a monotone circuit of size $2^{n - n/O(\log s)^{d-1}}$. We show that the existence of significantly faster monotone simulations would lead to breakthrough circuit lower bounds. In particular, if every monotone function in ${\sf AC^0}$ admits a polynomial size monotone circuit, then ${\sf NC^2}$ is not contained in ${\sf NC^1}$ . Finally, we revisit our separation result against monotone circuit size and investigate the limits of our approach, which is based on a monotone lower bound for constraint satisfaction problems established by Göös et al. (2019) via lifting techniques. Adapting results of Schaefer (1978) and Allender et al. (2009), we obtain an unconditional classification of the monotone circuit complexity of Boolean-valued CSPs via their polymorphisms. This result and the consequences we derive from it might be of independent interest.