248 search results - page 41 / 50 » Circuit-based Boolean Reasoning |
SAT
2010
Springer
13 years 7 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
FPGA
2009
ACM
14 years 4 months ago
2009
ACM
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
ISMVL
2009
IEEE
14 years 3 months ago
2009
IEEE
Determining the equivalence of reversible circuits designed to meet a common specification is considered. The circuits’ primary inputs and outputs must be in pure logic states ...
SARA
2009
Springer
14 years 3 months ago
2009
Springer
: Given a system design (SD), a key task is to optimize this design to reduce the probability of catastrophic failures. We consider the task of redesigning an SD to minimize the pr...