29 search results - page 5 / 6 » A Note on Satisfying Truth-Value Assignments of Boolean Form... |
120
Voted
STOC
2003
ACM
16 years 4 months ago
2003
ACM
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
117
click to vote
STACS
2004
Springer
15 years 9 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...
151
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
127
click to vote
JSAT
2006
15 years 3 months ago
2006
Abstract. We introduce new approaches intended to speed up determining the satisfiability of a given Boolean formula expressed as a conjunction of Boolean functions. A common prac...
128
Voted
JSAT
2008
15 years 3 months ago
2008
We show how to exploit the 32/64 bit architecture of modern computers to accelerate some of the algorithms used in satisfiability solving by modifying assignments to variables in ...