Image de couverture de livre

Complexity of basic boolean operators for digital circuit design

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Sergeev, Igor S.
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A note on the depth of optimal fanout-bounded prefix circuits
par: Sergeev, Igor S.
Publié: (2025)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
par: Sergeev, Ivan
Publié: (2024)

A basic lower bound for property testing
par: Fischer, Eldar
Publié: (2024)

Short circuit walks in fixed dimension
par: Black, Alexander E., et autres
Publié: (2025)

FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
par: Lanzinger, Matthias, et autres
Publié: (2023)

On the Complexity of Secluded Path Problems
par: Hanaka, Tesshu, et autres
Publié: (2026)

On the Streaming Complexity of Expander Decomposition
par: Chen, Yu, et autres
Publié: (2024)

Parameterized Complexity of Efficient Sortation
par: Ganian, Robert, et autres
Publié: (2024)

Parameterized Complexity of Simultaneous Planarity
par: Fink, Simon D., et autres
Publié: (2023)

Pairwise sequence alignment with block and character edit operations
par: Alıcıoğlu, Ahmet Cemal, et autres
Publié: (2023)

Matrix Multiplication Reductions
par: Gola, Ashish, et autres
Publié: (2024)

Towards Settling the Complexity of the Lettericity Problem
par: Grobler, Mario, et autres
Publié: (2026)

Computational Complexity of the Interval Ordering Problem
par: Pawlowski, Simeon, et autres
Publié: (2026)

On the Advice Complexity of Online Matching on the Line
par: Csaba, Béla, et autres
Publié: (2024)

Characterizing the integer points in 2-decomposable polyhedra by closedness under operations
par: Kimura, Kei, et autres
Publié: (2024)

The Communication Complexity of Pattern Matching with Edits Revisited
par: Kociumaka, Tomasz, et autres
Publié: (2026)

Query Complexity of the Metric Steiner Tree Problem
par: Chen, Yu, et autres
Publié: (2022)

On the Parallel Complexity of Finding a Matroid Basis
par: Khanna, Sanjeev, et autres
Publié: (2025)

Complexity Classes for Online Problems with and without Predictions
par: Berg, Magnus, et autres
Publié: (2024)

On the Complexity of Finding Approximate LCS of Multiple Strings
par: Hasibi, Hamed, et autres
Publié: (2025)

On the Complexity of Distributed Edge Coloring and Orientation Problems
par: Brandt, Sebastian, et autres
Publié: (2025)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
par: Ganian, Robert, et autres
Publié: (2024)

Matching (Multi)Cut: Algorithms, Complexity, and Enumeration
par: Gomes, Guilherme C. M., et autres
Publié: (2024)

On the Complexity of Minimising the Moving Distance for Dispersing Objects
par: Honorato-Droguett, Nicolás, et autres
Publié: (2025)

Semi-Robust Communication Complexity of Maximum Matching
par: Huete, Gabriel Cipriani, et autres
Publié: (2025)

The Complexity Landscape of Dynamic Distributed Subgraph Finding
par: Chang, Yi-Jun, et autres
Publié: (2024)

Algorithms and Complexity of Hedge Cluster Deletion Problems
par: Konstantinidis, Athanasios L., et autres
Publié: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
par: Funayama, Ryo, et autres
Publié: (2024)

Approximating Tensor Network Contraction with Sketches
par: Heddes, Mike, et autres
Publié: (2026)

Collision-Free Robot Scheduling
par: Adamson, Duncan, et autres
Publié: (2024)

On the Complexity of the Odd-Red Bipartite Perfect Matching Polytope
par: Nägele, Martin, et autres
Publié: (2026)

Two Complexity Results on Spanning-Tree Congestion Problems
par: Atalig, Sunny, et autres
Publié: (2026)

On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
par: Schlöter, Jens
Publié: (2025)

EF(X) Orientations: A Parameterized Complexity Perspective
par: Kanellopoulos, Sotiris, et autres
Publié: (2025)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
par: Huiberts, Sophie, et autres
Publié: (2022)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
par: Anand, Aditya, et autres
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Parameterized Complexity of MinCSP over the Point Algebra
par: Osipov, George, et autres
Publié: (2023)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
par: Blažej, Václav, et autres
Publié: (2024)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
par: Chen, Ho-Lin, et autres
Publié: (2026)