450 search results - page 42 / 90 » Satisfiability with Exponential Families |
100
click to vote
IANDC
2008
14 years 12 months ago
2008
Recently automated deduction tools have proved to be very effective for detecting attacks on cryptographic protocols. These analysis can be improved, for finding more subtle weakn...
AMAI
2005
Springer
14 years 11 months ago
2005
Springer
Many algorithms for Boolean satisfiability (SAT) work within the framework of resolution as a proof system, and thus on unsatisfiable instances they can be viewed as attempting to...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper presents a generalized semi-analytic method for computing oscillator phase noise spectra, including the details very close to the oscillation frequency. The starting po...
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Automata on infinite objects were the key to the solution of several fundamental decision problems in mathematics and logic. Today, automata on infinite objects are used for form...
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...