Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones

DOI10.1016/S0020-0190(99)00007-1MaRDI QIDQ1285764zbMATH OpenFDO

Authors Carsten Damm

Publication date 28 April 1999

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

circuit complexityomputational complexity

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 3916181
• The size and depth of layered Boolean circuits
• The size and depth of layered Boolean circuits
• Depth reduction for circuits of unbounded fan-in

Cites work

• scientific article; zbMATH DE number 4023423 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 1335881 (Why is no real title available?)
• A probabilistic remark on algebraic program testing
• Boolean complexity classes vs. their arithmetic analogs
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Making Nondeterminism Unambiguous
• Matching is as easy as matrix inversion
• Properties that characterize LOGCFL

Cited in

(2)

• scientific article; zbMATH DE number 3916181 (Why is no real title available?)
• The size and depth of layered Boolean circuits

This page was built for publication: Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1285764)