搜索结果: 1-3 共查到“数论 Complexity”相关记录3条 . 查询时间(0.062 秒)
Higher-order Fourier analysis of $\mathbb{F}_p^n$ and the complexity of systems of linear forms
Higher-order Fourier analysis linear forms
2010/11/24
Consider a subset $A$ of $\mathbb{F}_p^n$ and a decomposition of its indicator function as the sum of two bounded functions $1_A=f_1+f_2$. For every family of linear forms, we find the smallest degre...
Complexity Adjusted Soft-Output Sphere Decoding by Adaptive LLR Clipping
Soft-Output Sphere Decoding Adaptive LLR Clipping
2010/11/15
A-posteriori probability (APP) receivers operating over multiple-input, multiple-output channels provide enhanced performance at the cost of increased complexity. However, employing full APP processi...
Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstructing a dependency graph of bou...