理学 >>> 数学 >>> 数理逻辑与数学基础 数论 代数学 代数几何学 几何学 拓扑学 数学分析 非标准分析 函数论 常微分方程 偏微分方程 动力系统 积分方程 泛函分析 计算数学 概率论 数理统计学 应用统计数学 运筹学 组合数学 离散数学 模糊数学 应用数学 数学其他学科
搜索结果: 1-15 共查到数学 complexity相关记录69条 . 查询时间(0.203 秒)
Similar to the role of Markov decision processes in reinforcement learning, Markov games (also known as stochastic games) form the basis for the study of multi-agent reinforcement learning and sequenc...
We show the existence of a trivial, strongly minimal (and thus uncountably categorical) theory for which the prime model is computable and each of the other countable models computes 0 00. This res...
Borel complexity of complete, first order theories(status report).
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...
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 ...
This note presents a unified analysis of the recovery of simple objects from random linear measurements. When the linear functionals are Gaussian, we show that an s-sparse vector in Rn can be efficien...
While the 3-dimensional analogue of Sperner’s problem in the plane was known to be complete in class PPAD, the complexity of 2D-SPERNER itself is not known to be PPAD-complete or not. In this paper, w...
We study Farber's topological complexity (TC) of Davis' projective product spaces (PPS's). We show that, in many non-trivial instances, the TC of PPS's coming from at least two sphere factors is (much...
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a co...
We define and study an equivariant version of Farber's topological complexity for spaces with a given compact group action. This is a special case of the equivariant sectional category of an equivaria...
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...
Finite decomposition complexity m(FDC) is a large scale property of a metricspace. It generalizes finite asymptoticdimension and applies to a wide class of groups. To make the property quantitative, a...
In this paper we introduce a new technique for proving streaming lower bounds (and one-way communication lower bounds), by reductions from a problem called the Boolean Hidden Hypermatching problem (BH...
We study the complexity of testing if two given matroids are isomorphic. The problem is easily seen to be in p 2 . In the case of linear matroids, which are represented over polynomially growing fie...
Separating different propositional proof systems梩hat is, demonstrating that one proof system cannot efficiently simulate another proof system梚s one of the main goals of proof complexity. Nevertheless,...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...