Multilinear polynomials modulo composites

MaRDI QIDQ3568106zbMATH OpenFDO

Authors Arkadev Chattopadhyay

Publication date 17 June 2010

zbMATH Keywords

computing of Boolean functions by multilinear polynomialsconstant-depth circuits with MOD gates

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Recommendations

• Representing Boolean functions as polynomials modulo composite numbers
• scientific article; zbMATH DE number 2011859
• Lower bounds for modular counting by circuits with modular gates
• Complex polynomials and circuit lower bounds for modular counting
• Lower bounds for modular counting by circuits with modular gates

Cited in

(7)

• Learning read-constant polynomials of constant degree modulo composites
• Simulation theorems via pseudo-random properties
• Constructing Polynomials for Functions over Residue Rings Modulo a Composite Number in Linear Time
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• The NOF multiparty communication complexity of composed functions
• On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions
• Communication lower bounds using directional derivatives

This page was built for publication: Multilinear polynomials modulo composites

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