Noncommutative Polynomials Describing Convex Sets.
- Published in:
- Foundations of Computational Mathematics, 2021, v. 21, n. 2, p. 575, doi. 10.1007/s10208-020-09465-w
- By:
- Publication type:
- Article
Works matching IS 16153375 AND DT 2021 AND VI 21 AND IP 2
Results: 6
1
2
Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables.
- Published in:
- Foundations of Computational Mathematics, 2021, v. 21, n. 2, p. 275, doi. 10.1007/s10208-020-09462-z
- By:
- Publication type:
- Article
3
Topological Properties of the Set of Functions Generated by Neural Networks of Fixed Size.
- Published in:
- Foundations of Computational Mathematics, 2021, v. 21, n. 2, p. 375, doi. 10.1007/s10208-020-09461-0
- By:
- Publication type:
- Article
4
A Neural Network-Based Policy Iteration Algorithm with Global H2-Superlinear Convergence for Stochastic Games on Domains.
- Published in:
- Foundations of Computational Mathematics, 2021, v. 21, n. 2, p. 331, doi. 10.1007/s10208-020-09460-1
- By:
- Publication type:
- Article
5
The Grassmannian of affine subspaces.
- Published in:
- Foundations of Computational Mathematics, 2021, v. 21, n. 2, p. 537, doi. 10.1007/s10208-020-09459-8
- By:
- Publication type:
- Article
6
Weak Convergence Rates for Euler-Type Approximations of Semilinear Stochastic Evolution Equations with Nonlinear Diffusion Coefficients.
- Published in:
- Foundations of Computational Mathematics, 2021, v. 21, n. 2, p. 445, doi. 10.1007/s10208-020-09448-x
- By:
- Publication type:
- Article