325 search results - page 59 / 65 » Proofs of Restricted Shuffles |
146
click to vote
ICALP
2007
Springer
15 years 10 months 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...
137
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
155
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...
125
click to vote
CRYPTO
2005
Springer
15 years 9 months ago
2005
Springer
The Full-Domain Hash (FDH) signature scheme [3] forms one the most basic usages of random oracles. It works with a family F of trapdoor permutations (TDP), where the signature of m...
119
click to vote
STACS
2005
Springer
15 years 9 months ago
2005
Springer
An infinite binary sequence X is Kolmogorov-Loveland (or KL) random if there is no computable non-monotonic betting strategy that succeeds on X in the sense of having an unbounde...