472 search results - page 17 / 95 » Limiting Negations in Formulas |
CAV
2011
Springer
13 years 1 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
ACL
1994
13 years 11 months ago
1994
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
EACL
1993
ACL Anthology
13 years 11 months ago
1993
ACL Anthology
The dynamic interpretation of a formula as a binary relation (inducing transitions) on states is extended by alternative treatments of implication, universal quantification, negat...
AAAI
1996
13 years 11 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
ASIACRYPT
2011
Springer
12 years 10 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...