scientific article; zbMATH DE number 2032362

MaRDI QIDQ4446206zbMATH OpenFDO

Authors E. V. Valentinov

Publication date 26 January 2004

zbMATH Keywords

Boolean functioncontact circuit complexitylinear programmingreduced circuit

Mathematics Subject Classification ID

Boolean functions (06E30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 4176985
• scientific article; zbMATH DE number 1285549
• scientific article; zbMATH DE number 942481
• Complexity of self-correcting circuits for some sequence of Boolean functions
• scientific article; zbMATH DE number 850403

Cited in

(5)

• Proof of lower estimates for the complexity of self-correcting circuits by the method of basis changing
• scientific article; zbMATH DE number 4176985 (Why is no real title available?)
• scientific article; zbMATH DE number 8118 (Why is no real title available?)
• scientific article; zbMATH DE number 3284789 (Why is no real title available?)
• scientific article; zbMATH DE number 3390658 (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 Q4446206)