1795 search results - page 56 / 359 » On the Complexity of Circuit Satisfiability |
VLSI
2007
Springer
14 years 2 months ago
2007
Springer
System design complexity is growing rapidly. As a result, current development costs are constantly increasing. It is becoming increasingly difficult to estimate how much time it ...
DNA
2004
Springer
14 years 2 months ago
2004
Springer
Practically all of life’s molecular processes, from chemical synthesis to replication, involve enzymes that carry out their functions through the catalysis of metastable fuels in...
EUROCRYPT
2008
Springer
13 years 10 months ago
2008
Springer
Non-interactive zero-knowledge proofs and non-interactive witness-indistinguishable proofs have played a significant role in the theory of cryptography. However, lack of efficienc...
DAC
2005
ACM
14 years 9 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...
ISCAS
2008
IEEE
14 years 3 months ago
2008
IEEE
— An overview of digital enhancement techniques for analog circuits is presented. Recent research suggests that the high density and low energy of digital circuits can be leverag...