Isomorphism testing of read-once functions and polynomials

DOI10.4230/LIPICS.FSTTCS.2011.115MaRDI QIDQ2911617zbMATH OpenFDO

Authors B. V. Raghavendra Rao, Jayalal Sarma M. N.

Publication date 31 August 2012

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2011.115

zbMATH Keywords

computational complexityread-once formulasisomorphism problemsread-once polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Isomorphism testing of read-once functions and polynomials
• scientific article; zbMATH DE number 1332670
• Improved Polynomial Identity Testing for Read-Once Formulas
• On reconstruction and testing of read-once formulas
• The Formula Isomorphism Problem

Cited in

(4)

• Testing read-once functions over the elementary basis
• Building above read-once polynomials: identity testing and hardness of representation
• Isomorphism testing of read-once functions and polynomials
• Isomorphism testing of Boolean functions computable by constant-depth circuits

This page was built for publication: Isomorphism testing of read-once functions and polynomials

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