4 search results - page 1 / 1 » From Idempotent Generalized Boolean Assignments to Multi-bit... |
154
Voted
SAT
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
181
click to vote
ICALP
2007
Springer
16 years 15 days ago
2007
Springer
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
153
Voted
CP
2008
Springer
15 years 8 months ago
2008
Springer
Backbone variables have the same assignment in all solutions to a given constraint satisfaction problem; more generally, bias represents the proportion of solutions that assign a v...
196
Voted
CLEF
2009
Springer
15 years 7 months ago
2009
Springer
In this study, we describe our system at the Intellectual Property track of the 2009 CrossLanguage Evaluation Forum campaign (CLEF-IP). The CLEF-IP track addressed prior art searc...