arXiv subjects

Mandar Juvekar

Publications and source records attributed to Mandar Juvekar.

5 recordsLinked to original sources

arXiv2026

QMA Lower Bounds for Batch Verification via Approximate Degree

We study batch verification in QMA query and communication complexity, where the goal is to understand how the resources needed to verify $m$ copies of a Boolean function $f$ depend on $m$. We give a general technique for proving lower bounds on the witness-query tradeoff needed to batch verify a function $f$ in terms of its approximate degree. Applying this technique to an explicit family of DNF formulas $f$, we show that attempting to save even a constant factor on the witness length of the baseline approach to batch verifying $f$ necessitates a large polynomial increase in the query cost. We also obtain new lower bounds on the QMA query complexity of read-once CNF formulas and on the surjectivity and $k$-element distinctness functions. Our lower bounds also lift to give communication analogs of these results.

cs.CC↗

arXiv2024

Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting

Cai and Hemachandra used iterative constant-setting to prove that Few $\subseteq$ $\oplus$P (and thus that FewP $\subseteq$ $\oplus$P). In this paper, we note that there is a tension between the nondeterministic ambiguity of the class one is seeking to capture, and the density (or, to be more precise, the needed "nongappy"-ness) of the easy-to-find "targets" used in iterative constant-setting. In particular, we show that even less restrictive gap-size upper bounds regarding the targets allow one to capture ambiguity-limited classes. Through a flexible, metatheorem-based approach, we do so for a wide range of classes including the logarithmic-ambiguity version of Valiant's unambiguous nondeterminism class UP. Our work lowers the bar for what advances regarding the existence of infinite, P-printable sets of primes would suffice to show that restricted counting classes based on the primes have the power to accept superconstant-ambiguity analogues of UP. As an application of our work, we prove that the Lenstra-Pomerance-Wagstaff Conjecture implies that all (O(1) + loglogn)-ambiguity NP sets are in the restricted counting class $\rm RC_{PRIMES}$.

cs.CC↗

arXiv2023

Notions of Tensor Rank

Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also important. While there is one single definition of rank that completely captures the complexity of matrices (and thus linear transformations), there is no definitive analog for tensors. Rather, many notions of tensor rank have been defined over the years, each with their own set of uses. In this paper we survey the popular notions of tensor rank. We give a brief history of their introduction, motivating their existence, and discuss some of their applications in computer science. We also give proof sketches of recent results by Lovett, and Cohen and Moshkovitz, which prove asymptotic equivalence between three key notions of tensor rank over finite fields with at least three elements.

cs.CC↗

arXiv2021

On Arroyo-Figueroa's Proof that $\mathrm{P} \neq \mathrm{NP}$

We critique Javier Arroyo-Figueroa's paper titled ``The existence of the Tau one-way functions class as a proof that $\mathrm{P} \neq \mathrm{NP}$,'' which claims to prove $\mathrm{P} \neq \mathrm{NP}$ by showing the existence of a class of one-way functions. We summarize our best interpretation of Arroyo-Figueroa's argument, and show why it fails to prove the existence of one-way functions. Hence, we show that Arroyo-Figueroa fails to prove $\mathrm{P} \neq \mathrm{NP}$.

cs.CC↗

arXiv2020

Distinct Distances with $\ell_p$ Spaces

We study Erd\H os's distinct distances problem under $\ell_p$ metrics with integer $p$. We improve the current best bound for this problem from $Ω(n^{4/5})$ to $Ω(n^{6/7-ε})$, for any $ε>0$. We also characterize the sets that span an asymptotically minimal number of distinct distances under the $\ell_1$ and $\ell_\infty$ metrics.

math.CO↗