1379 search results - page 72 / 276 » The Complexity of the Annihilating Polynomial |
127
Voted
ACMSE
2006
ACM
15 years 4 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
114
Voted
FOCS
2008
IEEE
15 years 22 days ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
101
click to vote
CAGD
2008
15 years 21 days ago
2008
A plane algebraic curve can be represented as the zero-set of a polynomial in two - or if one takes homogenous coordinates: three - variables. The coefficients of the polynomial de...
108
click to vote
COCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
IS
2010
14 years 11 months ago
2010
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...