scientific article; zbMATH DE number 7561696
From MaRDI portal
Publication:5092414
DOI10.4230/LIPIcs.MFCS.2019.52MaRDI QIDQ5092414
B. V. Raghavendra Rao, C. Ramya
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1901.04377
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Lower bounds and separations for constant depth multilinear circuits
- The complexity of partial derivatives
- Balancing syntactically multilinear arithmetic circuits
- Improved Bounds for Reduction to Depth 4 and Depth 3
- Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs
- Fast Parallel Computation of Polynomials Using Few Processors
- Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications.
- Lower Bounds for Syntactically Multilinear Algebraic Branching Programs
- Identity Testing and Lower Bounds for Read- k Oblivious Algebraic Branching Programs
- Hitting sets for multilinear read-once algebraic branching programs, in any order
- Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs
- Separating multilinear branching programs and formulas
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- Lower bounds for special cases of syntactic multilinear ABPs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
