理学 >>> 物理学 >>> 理论物理学 >>> 数学物理 电磁场理论 经典场论 相对论与引力场 量子力学 统计物理学 理论物理学其他学科
搜索结果: 1-11 共查到理论物理学 Complexity相关记录11条 . 查询时间(0.302 秒)
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of ...
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length....
Aging is a fundamental aspect of living systems that undergo a progressive deterioration of physiological function with age and an increase of vulnerability to disease and death. Living systems, know...
We propose a phase-space Wigner harmonics entropy measure for many-body quantum dynamical complexity. This measure, which reduces to the well known measure of complexity in classical systems and whi...
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of compu...
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any bounded-error nonad...
We first present a protocol for deterministically distilling non-locality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)]. Our protocol, which is optimal for two...
2007Vol.48No.2pp.264-266DOI: Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database SHANG Bin School of Computer Science & Technology, ...
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature.For the d-dimensional grid graphs, the complexity has been determined asymptotic...
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity.That is, for a permutation group Γ, how low can the complexity be for any boolean fu...
Withdrawn. The results in the paper only work for a certain subclass of Boolean functions, in which block sensitivity has properties similar to those of ordinary sensitivity. They don’t work in genera...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

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

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...