364 search results - page 36 / 73 » Generalized normal forms and polynomial system solving |
ICISC
2007
14 years 11 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...
124
click to vote
IWPEC
2010
Springer
14 years 7 months ago
2010
Springer
We consider the computational complexity of a problem modeling bribery in the context of voting systems. In the scenario of Swap Bribery, each voter assigns a certain price for swa...
STOC
1994
ACM
15 years 1 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
92
Voted
SDM
2007
SIAM
14 years 11 months ago
2007
SIAM
Abnormal events, such as security attacks, misconfigurations, or electricity failures, could have severe consequences toward the normal operation of the Border Gateway Protocol (...
ICVS
2009
Springer
14 years 7 months ago
2009
Springer
This paper introduces a system that automatically classifies registration problems based on the type of registration required. Rather than rely on a single "best" algorit...