scientific article; zbMATH DE number 4031582

zbMATH Open0633.94024MaRDI QIDQ3772136FDOQ3772136

Alexander E. Andreev

Publication date: 1987

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

Recommendations

• scientific article
• Complexity of the realization of a linear Boolean function in the class of \(\pi\)-schemes
• scientific article; zbMATH DE number 4047105
• scientific article; zbMATH DE number 3328172
• A simplified proof of a lower complexity estimate

zbMATH Keywords

realization complexity\(\pi \)-schemes

Mathematics Subject Classification ID

Cited In (8)

• Fourier concentration from shrinkage
• Mining circuit lower bound proofs for meta-algorithms
• Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases
• On algorithm complexity
• An improved deterministic \#SAT algorithm for small De Morgan formulas
• Quantified Derandomization: How to Find Water in the Ocean
• Title not available (Why is that?)
• Title not available (Why is that?)

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