scientific article; zbMATH DE number 6007880

MaRDI QIDQ3115241zbMATH OpenFDO

Authors K. L. Rychkov

Publication date 20 February 2012

zbMATH Keywords

Boolean functioncomplexity of a circuitcontact circuit

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• scientific article; zbMATH DE number 4031582
• Method of determining lower bounds for the complexity of \(\Pi\)-circuits
• scientific article; zbMATH DE number 3328172
• The conditional distribution of the output of an automaton without memory for given characteristics of the input
• Complexity of the realization of a linear function in the class of -circuits
• scientific article; zbMATH DE number 522838
• Lower bounds for monotone q-multilinear Boolean circuits
• Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
• Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity
• A method for obtaining more than quadratic effective lower estimates of complexity of schemes

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 Q3115241)