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 | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Technical note : on nested partitions method for global optimization
Wu, Tao, (2021)
-
Optimal portfolio choice with benchmarks
Bernard, Carole, (2019)
-
A simple algorithm for solving Ramsey optimal policy with exogenous forcing variables
Chatelain, Jean-Bernard, (2017)
- 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)
-
Maximum-stopping-value policies in finite markov population decision chains
Eaves, Burchett Curtis, (2014)
- More ...