The complexity of word circuits

DOI10.1142/S1793830910000826MaRDI QIDQ3084681zbMATH OpenOpenAlexFDO

Authors Xue Chen, Guangda Hu, Xiaoming Sun

Publication date 25 March 2011

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830910000826

zbMATH Keywords

Boolean functionsword circuitsword gates

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorics on words (68R15)

Recommendations

• The complexity of word circuits
• Hilbert's thirteenth problem and circuit complexity
• scientific article; zbMATH DE number 1256716
• Universal circuits (Preliminary Report)
• On the multiplicative complexity of binary words with a given number of units.

Cited in

(4)

• On the Complexity of Input/Output Logic
• The complexity of word circuits
• Hilbert's thirteenth problem and circuit complexity
• Asymptotically Optimal Circuit for a Storage Access Function

This page was built for publication: The complexity of word circuits

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