Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Pranav Bisht:

TR23-109 | 21st July 2023
Pranav Bisht, Nikhil Gupta, Ilya Volkovich

Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae

An arithmetic formula is an arithmetic circuit where each gate has fan-out one. An \emph{arithmetic read-once formula} (ROF in short) is an arithmetic formula where each input variable labels at most one leaf. In this paper we present several efficient blackbox \emph{polynomial identity testing} (PIT) algorithms for some classes of ... more >>>

ISSN 1433-8092 | Imprint