scientific article; zbMATH DE number 4047102

MaRDI QIDQ3783560zbMATH OpenFDO

Authors N. K. Kossovskii

Publication date 1987

zbMATH Keywords

combinational complexitypolynomial lower bounds

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Lower bounds for the complexity of polynomials
• scientific article; zbMATH DE number 619540
• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity
• scientific article; zbMATH DE number 4102490
• On lower bounds for the complexity of polynomials and their multiples
• scientific article; zbMATH DE number 2086916
• scientific article; zbMATH DE number 69493
• Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables
• Computational bound on complexity of polynomial representations of Boolean functions

Cited in

(2)

• Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
• A nonlinear lower bound on the practical combinational complexity

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