Diagonal Circuit Identity Testing and Lower Bounds
From MaRDI portal
Publication:3521908
DOI10.1007/978-3-540-70575-8_6zbMath1152.68703OpenAlexW2139434573MaRDI QIDQ3521908
Publication date: 28 August 2008
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2008/1308/
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (20)
Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ Fast exact algorithms using Hadamard product of polynomials ⋮ On the limits of depth reduction at depth 3 over small finite fields ⋮ Schur polynomials do not have small formulas if the determinant does not ⋮ Unnamed Item ⋮ Deterministic polynomial identity tests for multilinear bounded-read formulae ⋮ A case of depth-3 identity testing, sparse factorization and duality ⋮ Unnamed Item ⋮ Read-once polynomial identity testing ⋮ Recent Results on Polynomial Identity Testing ⋮ Improved Explicit Hitting-Sets for ROABPs ⋮ A note on parameterized polynomial identity testing using hitting set generators ⋮ Unnamed Item ⋮ Blackbox identity testing for sum of special ROABPs and its border class ⋮ Arithmetic Circuits: A Chasm at Depth 3 ⋮ Geometric complexity theory V: Efficient algorithms for Noether normalization ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ Linear projections of the Vandermonde polynomial ⋮ Improved hitting set for orbit of ROABPs ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
This page was built for publication: Diagonal Circuit Identity Testing and Lower Bounds
