1795 search results - page 221 / 359 » On the Complexity of Circuit Satisfiability |
111
click to vote
AI
2008
Springer
15 years 1 months ago
2008
Springer
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
110
click to vote
ICCD
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper proposes an efficient analysis flow and an algorithm to identify the worst case noise for power networks with multiple clock domains. First, we apply the Laplace transf...
101
click to vote
STACS
2010
Springer
15 years 8 months ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...
120
click to vote
ASPDAC
2009
ACM
15 years 7 months ago
2009
ACM
—Reversible logic studies have promising potential on energy lossless circuit design, quantum computation, nanotechnology, etc. Reversible logic features a one-to-one input outpu...
109
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
The progressive trend of fabrication technologies towards the nanometer regime has created a number of new physical design challenges for computer architects. Design complexity, u...