248 search results - page 25 / 50 » Circuit-based Boolean Reasoning |
173
Voted
ESSLLI
2009
Springer
15 years 2 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
128
Voted
IRI
2007
IEEE
15 years 11 months ago
2007
IEEE
This last decade, propositional reasoning and search has been one of the hottest topics of research in the A.I. community, as the Boolean framework has been recognized as a powerf...
136
Voted
CHES
2004
Springer
15 years 10 months ago
2004
Springer
Cryptographic algorithms implemented on smart-cards must be protected against side-channel attacks. Some encryption schemes and hash functions like IDEA, RC6, MD5, SHA-1 alternate ...
124
Voted
SAT
2004
Springer
15 years 10 months ago
2004
Springer
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
118
Voted
FLAIRS
2008
15 years 7 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...