scientific article; zbMATH DE number 6862067

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

Ramya C., B. V. Raghavendra Rao

Publication date: 19 April 2018

Title of this publication is not available (Why is that?)

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:

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