1795 search results - page 29 / 359 » On the Complexity of Circuit Satisfiability |
ASPDAC
2009
ACM
14 years 3 months ago
2009
ACM
- We proposed a novel Boolean Satisfiability (SAT)-controlled redundancy addition and removal (RAR) algorithm to resolve the performance and quality problems of
ISCAS
2003
IEEE
14 years 1 months ago
2003
IEEE
An analog QRS complex detection circuit, for pacemaker applications, based on the Wavelet Transform (WT) is presented. The system detects the wavelet modulus maxima of the QRS com...
GECCO
2000
Springer
14 years 7 days ago
2000
Springer
A mathematical formula containing one or more free variables is "general" in the sense that it represents the solution to all instances of a problem (instead of just the...
AICCSA
2006
IEEE
13 years 10 months ago
2006
IEEE
To excite a stuck-open fault in a CMOS combinational circuit, it is only necessary that the output of the gate containing the fault takes on opposite values during the application...
JC
2008
13 years 8 months ago
2008
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...