216 search results - page 5 / 44 » On the number of minima of a random polynomial |
156
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
We show that random DNF formulas, random log-depth decision trees and random deterministic finite acceptors cannot be weakly learned with a polynomial number of statistical queries...
175
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We present a Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods. To test if a polynomial P(x1 ::: xn) ...
164
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
194
click to vote
CISC
2007
Springer
16 years 26 days ago
2007
Springer
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
194
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...