1168 search results - page 79 / 234 » cases 2000 |
RSA
2000
13 years 9 months ago
2000
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...
SIAMCO
2000
13 years 9 months ago
2000
In a financial market consisting of a nonrisky asset and a risky one, we study the minimal initial capital needed in order to superreplicate a given contingent claim under a gamma ...
SIAMCOMP
2000
13 years 9 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
JAR
2010
13 years 8 months ago
2010
We give a short survey of the main principles of our software for the visualisation and animation in mathematics and study the visibility and contour problems in the representation...
MICS
2010
13 years 8 months ago
2010
Abstract. Following Gaudry and G¨urel who extended Kedlaya’s point-counting algorithm to superelliptic curves, we introduce Harvey’s running time improvements for large enough...