1379 search results - page 11 / 276 » The Complexity of the Annihilating Polynomial |
188
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
124
click to vote
AAAI
2007
15 years 8 months ago
2007
An Unobservable MDP (UMDP) is a POMDP in which there are no observations. An Only-Costly-Observable MDP (OCOMDP) is a POMDP which extends an UMDP by allowing a particular costly a...
157
click to vote
CSR
2006
Springer
15 years 9 months ago
2006
Springer
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
153
click to vote
LATIN
2010
Springer
16 years 26 days ago
2010
Springer
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
180
click to vote
TSP
2010
15 years 22 days ago
2010
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...