1399 search results - page 137 / 280 » Multi-party Finite Computations |
130
click to vote
Lecture Notes
These notes cover several topics such as Univariate Time Series Analysis, The Distribution of a Sample Average, Least Squares, Instrumental Variable Method, Simulating the Finite S...
139
click to vote
EUROCRYPT
2000
Springer
15 years 7 months ago
2000
Springer
We present an index-calculus algorithm for the computation of discrete logarithms in the Jacobian of hyperelliptic curves defined over finite fields. The complexity predicts that i...
140
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
We study the worst case complexity of regular operations on cofinite languages (i.e., languages whose complement is finite) and provide algorithms to compute efficiently the result...
123
click to vote
DAGSTUHL
2006
15 years 5 months ago
2006
We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true dis...
ECCC
2010
15 years 4 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...