A Boolean circuit is a collection of gates and wires that performs a mapping from Boolean inputs to Boolean outputs. The accepted wisdom is that such circuits must have acyclic (i.e., loop-free or feed-forward) topologies. In fact, the model is often defined this way–as a directed acyclic graph (DAG). And yet simple examples suggest that this is incorrect. We advocate that Boolean circuits should have cyclic topologies (i.e., loops or feedback paths). In other work, we demonstrated the practical implications of this view: digital circuits can be designed with fewer gates if they contain cycles. In this paper, we explore the theoretical underpinnings of the idea. We show that the complexity of implementing Boolean functions can be lower with...
AbstractThis paper considers the following problem: given a specification consisting of a set of var...
AbstractBoolean circuits are used to represent programs on finite data. Reversible Boolean circuits ...
circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no ...
A Boolean circuit is a collection of gates and wires that performs a mapping from Boolean inputs to ...
AbstractA Boolean circuit is a collection of gates and wires that performs a mapping from Boolean in...
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for...
Digital circuits are called combinational if they are memoryless: they have outputs that depend only...
Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for ...
Digital circuits are called combinational if they are memoryless: if they have outputs that depend o...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
Abstract. Any Boolean function can be defined by a Boolean circuit, provided we may use sufficiently...
Compiling high-level hardware languages can produce circuits containing combinational cycles that ca...
AbstractThe layout area of Boolean circuits is considered as a complexity measure of Boolean functio...
This paper considers cost of logic circuits that implement Boolean functions. The realization of Boo...
We propose a new model for exact learning of acyclic circuits using experiments in which chosen valu...
AbstractThis paper considers the following problem: given a specification consisting of a set of var...
AbstractBoolean circuits are used to represent programs on finite data. Reversible Boolean circuits ...
circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no ...
A Boolean circuit is a collection of gates and wires that performs a mapping from Boolean inputs to ...
AbstractA Boolean circuit is a collection of gates and wires that performs a mapping from Boolean in...
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for...
Digital circuits are called combinational if they are memoryless: they have outputs that depend only...
Designers and high-level synthesis tools can introduce unwanted cycles in digital circuits, and for ...
Digital circuits are called combinational if they are memoryless: if they have outputs that depend o...
AbstractWe compare the two computational models of Boolean circuits and arithmetic circuits in cases...
Abstract. Any Boolean function can be defined by a Boolean circuit, provided we may use sufficiently...
Compiling high-level hardware languages can produce circuits containing combinational cycles that ca...
AbstractThe layout area of Boolean circuits is considered as a complexity measure of Boolean functio...
This paper considers cost of logic circuits that implement Boolean functions. The realization of Boo...
We propose a new model for exact learning of acyclic circuits using experiments in which chosen valu...
AbstractThis paper considers the following problem: given a specification consisting of a set of var...
AbstractBoolean circuits are used to represent programs on finite data. Reversible Boolean circuits ...
circuit is one which can be decomposed into nonintersecting blocks of gates where each block has no ...