1380 search results - page 149 / 276 » A General Polynomial Sieve |
146
click to vote
ECAI
2008
Springer
15 years 8 months ago
2008
Springer
We study the CARDPATH constraint. This ensures a given constraint holds a number of times down a sequence of variables. We show that SLIDE, a special case of CARDPATH where the sli...
133
Voted
AAAI
2010
15 years 8 months ago
2010
We consider a very natural problem concerned with game manipulation. Let G be a directed graph where the nodes represent players of a game, and an edge from u to v means that u ca...
189
click to vote
AAAI
2010
15 years 8 months ago
2010
Recently, algorithms for computing game-theoretic solutions have been deployed in real-world security applications, such as the placement of checkpoints and canine units at Los An...
180
click to vote
CCCG
2010
15 years 8 months ago
2010
By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respective...
184
click to vote
ICISC
2007
15 years 8 months ago
2007
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...