1795 search results - page 58 / 359 » On the Complexity of Circuit Satisfiability |
DAC
2000
ACM
14 years 9 months ago
2000
ACM
Contemporary microprocessors implement many iterative algorithms. For example, the front-end of a microprocessor repeatedly fetches and decodes instructions while updating interna...
FCT
2009
Springer
14 years 3 months ago
2009
Springer
In the uniform circuit model of computation, the width of a boolean circuit exactly characterises the “space” complexity of the computed function. Looking for a similar relatio...
ICCAD
1995
IEEE
14 years 8 days ago
1995
IEEE
In this paper, a new approach to analog test design based on the circuit design process, called Characteristic Observation Inference (COI), is presented. In many situations, it is...
DAC
1998
ACM
14 years 29 days ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
AMAI
2004
Springer
14 years 2 months ago
2004
Springer
This paper studies the relative proof complexity of variations of a tableau method for Boolean circuit satisfiability checking obtained by restricting the use of the cut rule in s...