36 search results - page 4 / 8 » General Iteration graphs and Boolean automata circuits |
DAM
2007
13 years 7 months ago
2007
R. Thomas conjectured, twenty years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of severa...
STOC
1989
ACM
13 years 11 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
ICCD
2000
IEEE
14 years 4 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
DAC
2005
ACM
14 years 8 months ago
2005
ACM
This paper attempts to quantify the optimality of FPGA technology mapping algorithms. We develop an algorithm, based on Boolean satisfiability (SAT), that is able to map a small s...