Sum of products of read-once formulas

DOI10.4230/LIPICS.FSTTCS.2016.39zbMATH Open1393.68082MaRDI QIDQ4636588FDOQ4636588

Authors: Ramya C., B. V. Raghavendra Rao 

Publication date: 19 April 2018

Recommendations

• Lower bounds for sum and sum of products of read-once formulas
• Sums of read-once formulas: how many summands suffice?
• Sums of read-once formulas: how many summands are necessary?
• Arithmetic circuit lower bounds via MaxRank
• Improved Polynomial Identity Testing for Read-Once Formulas

zbMATH Keywords

computational complexityalgebraic complexity theoryarithmetic circuitspermanent

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Determinants, permanents, traces, other special matrix functions (15A15)

Cited In (3)

• How Do Read-Once Formulae Shrink?
• Sums of read-once formulas: how many summands are necessary?
• Sum-product formulae

This page was built for publication: Sum of products of read-once formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4636588)