Convex hulls of random walks, hyperplane arrangements, and Weyl chambers
- 期刊名称Geometric and Functional Analysis
- 作者Kabluchko, Zakhar; Vysotsky, Vladislav; Zaporozhets, Dmitry
- 卷第27卷
- 期第4期
- 印刷ISSN1016-443X
- 电子ISSN1420-8970
- 文件大小829.10KB
- 发表时间2017-7
- DOI10.1007/s00039-017-0415-x
- 页码880-918
An editorialJoachim von zur Gathen · Computational Complexity · 1991
Instructions for preparing camera-ready manuscriptsComputational Complexity · 1991
Decompositions of algebras over ℝ and ℂWayne Eberly · Computational Complexity · 1991
Improving known solutions is hardDesh Ranjan; Suresh Chari; Pankaj Rohatgi · Computational Complexity · 1993
Parallel pointer machinesStephen A. Cook; Patrick W. Dymond · Computational Complexity · 1993
A deterministic test for permutation polynomialsI. E. Shparlinski · Computational Complexity · 1992
Counting curves and their projectionsJoachim von zur Gathen; Marek Karpinski; Igor Shparlinski · Computational Complexity · 1996-1997
The hardness of approximation: Gap locationErez Petrank · Computational Complexity · 1994