1 citations · 1 across the 4 of their papers we have counts for
4 papers
QMA Lower Bounds for Batch Verification via Approximate Degree
Mark Bun, Mandar Juvekar, Samuel King
We study batch verification in QMA query and communication complexity, where the goal is to understand how the resources needed to verify copies of a Boolean function depen…
Notions of Tensor Rank
Mandar Juvekar, Arian Nadjimzadah
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 quan…
Gaps, Ambiguity, and Establishing Complexity-Class Containments via Iterative Constant-Setting
Lane A. Hemaspaandra, Mandar Juvekar, Arian Nadjimzadah +1
Cai and Hemachandra used iterative constant-setting to prove that Few P (and thus that FewP P). In this paper, we note that there is a tensi…
On Arroyo-Figueroa's Proof that
Mandar Juvekar, David E. Narváez, Melissa Welsh
We critique Javier Arroyo-Figueroa's paper titled ``The existence of the Tau one-way functions class as a proof that ,'' which claims to prove $\mathrm…