1795 search results - page 37 / 359 » On the Complexity of Circuit Satisfiability |
126
click to vote
MFCS
2007
Springer
15 years 12 months ago
2007
Springer
Following recent works connecting two-variable logic to circuits and monoids, we establish, for numerical predicate sets P satisfying a certain closure property, a one-to-one corre...
147
click to vote
DFT
2003
IEEE
15 years 11 months ago
2003
IEEE
A new methodology for designing logic circuits with partial error masking is described. The key idea is to exploit the asymmetric soft error susceptibility of nodes in a logic cir...
157
click to vote
STOC
1989
ACM
15 years 10 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...
163
click to vote
ENGL
2008
15 years 6 months ago
2008
Multiple-valued quantum circuits are promising choices for future quantum computing technology, since the multiple-valued quantum system is more compact than the corresponding bina...
134
click to vote
DATE
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we present a two-level modeling approach to performance macromodeling based on radial basis function Support Vector Machine (SVM). The two-level model consists of a...