Saved in:
Bibliographic Details
Main Author: Sergeev, Igor S.
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.24319
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • This article provides a survey of circuit complexity bounds for basic boolean transforms exploited in digital circuit design and efficient methods for synthesizing such circuits. The exposition covers structurally simple functions and operators, such as counters, adders, encoders, and multiplexors, and excludes more complex algebraic operations with numbers, polynomials, and matrices. Several applications to implementing more specific operations are also discussed.