160 search results - page 18 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
STOC
2007
ACM
15 years 12 months ago
2007
ACM
For more than 35 years, the fastest known method for integer multiplication has been the Sch?onhage-Strassen algorithm running in time O(n log n log log n). Under certain restricti...
DAC
2006
ACM
16 years 19 days ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...
91
Voted
CP
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we present an algorithm for finding utilitarian optimal solutions to Simple and Disjunctive Temporal Problems with Preferences (STPPs and DTPPs) based on Benders’...
110
click to vote
ASPDAC
2009
ACM
15 years 6 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...
103
click to vote
SIAMCOMP
2010
14 years 10 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...