352 search results - page 46 / 71 » Proofs as Polynomials |
173
Voted
PKC
2011
Springer
14 years 6 months ago
2011
Springer
We investigate the security of a generalization of HFE (multivariate and odd-characteristic variants). First, we propose an improved version of the basic Kipnis-Shamir key recovery...
128
Voted
CADE
2007
Springer
16 years 3 months ago
2007
Springer
We introduce a calculus for handling integer arithmetic in first-order logic. The method is tailored to Java program verification and meant to be used both as a supporting procedur...
132
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
119
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...
114
Voted
ISSAC
2009
Springer
15 years 10 months ago
2009
Springer
We show that detecting real roots for honestly n-variate (n + 2)-nomials (with integer exponents and coefficients) can be done in time polynomial in the sparse encoding for any ï¬...