搜索结果: 1-7 共查到“计算数学 complexity”相关记录7条 . 查询时间(0.046 秒)
Karp complexity and classes with the independence property
Karp complexity independence property
2015/9/25
A class K of structures is controlled if for all cardinals
λ, the relation of L∞,λ-equivalence partitions K into a set of
equivalence classes (as opposed to a proper class). We prove that
no pseudo...
Filter design with low complexity coefficients
Heuristic design low complexity coefficient filters with nonzero number the filter coefficients
2015/8/10
We introduce a heuristic for designing filters that have low complexity coefficients, as measured by the total number of nonzeros digits in the binary or canonic signed digit (CSD) representations of ...
A cooperative conjugate gradient method for linear systems permitting multithread implementation of low complexity
cooperative conjugate gradient method linear systems multithread implementation low complexity Numerical Analysis
2012/3/31
This paper proposes a generalization of the conjugate gradient (CG) method used to solve the equation $Ax=b$ for a symmetric positive definite matrix $A$ of large size $n$. The generalization consists...
On the computational complexity of stochastic controller optimization in POMDPs
Partially observable Markov decision process stochastic controller bilinear program computational complexity Motzkin-Straus theorem
2011/7/15
Abstract: We show that the problem of finding an optimal stochastic 'blind' controller in a Markov decision process is an NP-hard problem. The corresponding decision problem is NP-hard, in PSPACE, and...
Duality Gap, Computational Complexity and NP Completeness: A Survey
Duality Gap Computational Complexity NP Completeness
2010/12/30
In this paper, we survey research that studies the connection between the computational complexity of optimization problems on the one hand, and the duality gap between the primal and dual optimizatio...
On the complexity of non-unique probe selection
Non-unique probe selection Separable matrices DP-complete P
2008/8/25
We investigate the computational complexity of some basic problems regarding non-unique probe selection using separable matrices. In particular, we prove that the minimal d?separable matrix problem is...
We obtain the optimal order of high-dimensional integration complexity in the quantum computation model in anisotropic Sobolev classes $W_{\infty}^{\bf r}([0,1]^d)$ and H$\rm{\ddot{o}}$lder Nikolskii ...