scientific article; zbMATH DE number 1206052

MaRDI QIDQ4209094zbMATH OpenFDO

Authors N. K. Kossovskii

Publication date 9 November 1998

zbMATH Keywords

Boolean functionsnondeterministic Turing machine

Mathematics Subject Classification ID

Recommendations

• A nonlinear lower bound on the practical combinational complexity
• A nonlinear lower bound on the practical combinational complexity
• scientific article; zbMATH DE number 3970686
• scientific article; zbMATH DE number 4047105
• scientific article; zbMATH DE number 4172394

Cited in

(3)

• The Mersenne Low Hamming Combination Search problem can be reduced to an ILP problem
• scientific article; zbMATH DE number 1722667 (Why is no real title available?)
• scientific article; zbMATH DE number 6520244 (Why is no real title available?)

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