On the complexity of encoding in analog circuits

DOI10.1016/S0020-0190(96)00137-8MaRDI QIDQ1350006zbMATH OpenOpenAlexFDO

Authors Ingo Wegener

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/s0020-0190(96)00137-8

zbMATH Keywords

Boolean functionsComputational complexityAnalog circuits

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analytic circuit theory (94C05)

Recommendations

• Efficient digital-to-analog encoding
• On the computation of Boolean functions by analog circuits of bounded fan-in
• Publication:3496295
• Bounds for code length for circuits of functional elements

Cites work

• scientific article; zbMATH DE number 4012495 (Why is no real title available?)
• scientific article; zbMATH DE number 3257409 (Why is no real title available?)
• A Boolean function requiring 3n network size
• On the computation of Boolean functions by analog circuits of bounded fan-in
• The complexity of the parity function in unbounded fan-in, unbounded depth circuits

Cited in

(5)

• Analog reducibility
• Computability of analog networks
• On the computation of Boolean functions by analog circuits of bounded fan-in
• The complexity of analog computation
• The Coding of Internal States of Sequential Circuits

This page was built for publication: On the complexity of encoding in analog circuits

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