An exact correspondence of linear problems and randomizing linear algorithms
Year of publication: |
2014
|
---|---|
Authors: | Eaves, Burchett Curtis ; Rothblum, Uriel G. |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 39.2014, 3, p. 607-623
|
Subject: | linear problems | data-solution pairs | randomizing linear algorithms | input-output pairs | equivalence | bijection | predicate language | parametric Fourier quantifier elimination | ordered fields | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Schätztheorie | Estimation theory |
-
Effective asymptotics analysis for finance
Grunspan, Cyril, (2020)
-
Bissantz, Nicolai, (2008)
-
Roundoff-error-free algorithms for solving linear systems via Cholesky and LU factorizations
Escobedo, Adolfo R., (2015)
- More ...
-
Generating approximate parametric roots of parametric polynomials
Eaves, Burchett Curtis, (2016)
-
A course in triangulations for solving equations with deformations
Eaves, Burchett Curtis, (1984)
-
Computing equilibria in the GEI model
Brown, Donald J., (1993)
- More ...