Image de couverture de livre

Delay-Optimum Adder Circuits with Linear Size

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brenner, Ulrich, Görg, Benjamin David
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Automating Proofs of Multiplier Adder Trees using the RTL Books
par: Manjrekar, Mayank
Publié: (2025)

On the Unprovability of Circuit Size Bounds in Intuitionistic $\mathsf{S}^1_2$
par: Chen, Lijie, et autres
Publié: (2024)

A Game for Counting Logic Formula Size and an Application to Linear Orders
par: Fournier, Gregoire, et autres
Publié: (2025)

Faster Linear-Size And-Or Path and Adder Circuits
par: Brenner, Ulrich, et autres
Publié: (2024)

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic (Extended Abstract)
par: Gheorghiu, Alexander V., et autres
Publié: (2023)

A Simple Constructive Bound on Circuit Size Change Under Truth Table Perturbation
par: Krinkin, Kirill
Publié: (2026)

Computing with Infinite Objects: the Gray Code Case
par: Spreen, Dieter, et autres
Publié: (2021)

A Linear Temporal Logic of Frequencies on Series of Events
par: Antonelli, Melissa, et autres
Publié: (2026)

Proof Complexity of Linear Logics
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2026)

Linear Arboreal Categories
par: Abramsky, Samson, et autres
Publié: (2023)

Compositional Control-Driven Boolean Circuits
par: Arellanes, Damian
Publié: (2025)

A Complete Graphical Language for Linear Optical Circuits with Finite-Photon-Number Sources and Detectors
par: Heurtel, Nicolas
Publié: (2024)

Practical Boolean Decomposition for Delay-driven LUT Mapping
par: Calvino, Alessandro Tempia, et autres
Publié: (2024)

Shininess, strong politeness, and unicorns
par: Przybocki, Benjamin, et autres
Publié: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
par: Przybocki, Benjamin, et autres
Publié: (2025)

Bringing closure to theory combination properties
par: Toledo, Guilherme V., et autres
Publié: (2026)

Being polite is not enough (and other limits of theory combination)
par: Toledo, Guilherme V., et autres
Publié: (2025)

Simplifier: A New Tool for Boolean Circuit Simplification
par: Averkov, Daniil, et autres
Publié: (2025)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
par: Przybocki, Benjamin, et autres
Publié: (2024)

On the Computational Content of Moduli of Regularity and their Logical Strength
par: Kohlenbach, Ulrich
Publié: (2026)

Compiling Quantum Lambda-Terms into Circuits via the Geometry of Interaction
par: Chardonnet, Kostia, et autres
Publié: (2026)

Linear-Time--Branching-Time Spectroscopy Accounting for Silent Steps
par: Bisping, Benjamin, et autres
Publié: (2023)

The Size-Change Principle for Mixed Inductive and Coinductive types
par: Hyvernat, Pierre
Publié: (2024)

Constructing (Co)inductive Types via Large Sizes
par: Laarakker, Bastiaan, et autres
Publié: (2026)

Optimal Circuit Synthesis of Linear Codes for Error Detection and Correction
par: Yang, Xi, et autres
Publié: (2026)

A dual characterisation of simple and subdirectly-irreducible temporal Heyting algebras
par: Alvarez, David Quinn
Publié: (2025)

Foundations of Digital Circuits: Denotation, Operational, and Algebraic Semantics
par: Kaye, George
Publié: (2025)

Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving
par: Shi, Zhengyuan, et autres
Publié: (2024)

Skolemisation for Intuitionistic Linear Logic
par: Bruni, Alessandro, et autres
Publié: (2024)

Linear Programming in Isabelle/HOL
par: Parsert, Julian
Publié: (2024)

Linear Realisability and Implicative Algebras
par: Lucquin, Alexandre, et autres
Publié: (2026)

Enumerating Independent Linear Inferences
par: Das, Anupam, et autres
Publié: (2021)

Uniformity within Parameterized Circuit Classes
par: Hegeman, Steef, et autres
Publié: (2025)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
par: Lommen, Nils, et autres
Publié: (2023)

MCAC: A Model Counting Algorithm for Exact Computation of Error Metrics of Approximate Circuits
par: Ramprasath, S, et autres
Publié: (2024)

Superposition with Delayed Unification
par: Bhayat, Ahmed, et autres
Publié: (2024)

Did Turing prove the undecidability of the halting problem?
par: Hamkins, Joel David, et autres
Publié: (2024)

Base-extension Semantics for Modal Logic
par: Eckhardt, Timo, et autres
Publié: (2024)

Base-extension Semantics for Intuitionistic Modal Logics
par: Buzoku, Yll, et autres
Publié: (2025)

Dynamic Cantor Derivative Logic
par: Fernández-Duque, David, et autres
Publié: (2021)