1278 search results - page 12 / 256 » The Complexity of Weighted Boolean |
FPGA
1998
ACM
13 years 11 months ago
1998
ACM
In this paper, we developed Boolean matching techniques for complex programmable logic blocks (PLBs) in LUT-based FPGAs. A complex PLB can not only be used as a K-input LUT, but a...
JSAT
2006
13 years 7 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of t...
DFG
1992
Springer
13 years 11 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
ISAAC
2004
Springer
14 years 28 days ago
2004
Springer
