본문

  1. Home
4 Results:SS:RANDOMIZEDALGORITHM 0.93 sec.
RSS 
다국어입력
 상세검색
 신착검색
1
Towards Efficient Algorithms and Systems for Tensor Decompositions and Tensor Networks
Towards Efficient Algorithms and Systems for Tensor Decompositions and Tensor Networks
Ma, Linjian. | University of Illinois at Urbana-Champaign | 2023
미리보기
위치정보
2
Algorithms for Sparsity-Constrained Optimization Problems - On Polynomial Solvability and Approximability
Algorithms for Sparsity-Constrained Optimization Problems - On Polynomial Solvability and Approximability
Zhou, Dekun. | The University of Wisconsin - Madison | 2025
미리보기
위치정보
3
Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes
Probabilistic Computations: Mild Derandomizatons and Zero-Knowledge Classes
Dixon, Peter. | Iowa State University | 2021
미리보기
위치정보
4
Topics in Matrix and Tensor Computations
Topics in Matrix and Tensor Computations
Malik, Osman Asif. | University of Colorado at Boulder | 2021
미리보기
위치정보
처음1마지막