5981 search results - page 1001 / 1197 » time 2006 |
154
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
168
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
ABSTRACT. Reasoning with diagrams: cognitive and computational perspectives. Diagrammatic, analogical or iconic representations are often contrasted with linguistic or logical repr...
146
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We present a deterministic approximation algorithm to compute logarithm of the number of `good' truth assignments for a random k-satisfiability (k-SAT) formula in polynomial ...