scientific article; zbMATH DE number 4031582

MaRDI QIDQ3772136zbMATH OpenFDO

Authors Alexander E. Andreev

Publication date 1987

zbMATH Keywords

realization complexity\(\pi \)-schemes

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 4078803
• 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

Cited in

(10)

• Fourier concentration from shrinkage
• Mining circuit lower bound proofs for meta-algorithms
• A simplified proof of a lower complexity estimate
• On algorithm complexity
• On multiplexer function complexity in the \(\pi\)-schemes class
• An improved deterministic \#SAT algorithm for small De Morgan formulas
• Quantified Derandomization: How to Find Water in the Ocean
• scientific article; zbMATH DE number 6007880 (Why is no real title available?)
• scientific article; zbMATH DE number 4078803 (Why is no real title available?)
• Satisfiability algorithms and lower bounds for Boolean formulas over finite bases

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)