352 search results - page 17 / 71 » Proofs as Polynomials |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
In this paper we present a simple deterministic algorithm for testing whether a multivariate polynomial f(x1, . . . , xn) is identically zero, in time polynomial in m, n, log(d + ...
Publication
In this note we aim to give a new, elementary proof of a statement that was first proved by Timofte (2003) [15]. It says that a symmetric real polynomial F of degree d in n variabl...