搜索结果: 1-15 共查到“理学 P = NP”相关记录29条 . 查询时间(0.078 秒)
中国科学院微生物研究所专利：流感病毒NP蛋白突变体及其编码基因与应用
NP：太阳耀斑辐射扰动磁层空间（图）
NP 太阳耀斑 辐射 磁层空间
2021/4/9
太阳耀斑是一种最剧烈的太阳爆发现象。耀斑在短短一二十分钟内，可释放出几十亿颗百万吨级氢弹爆炸相当的能量，耀斑期间产生的X射线及极紫外辐射等不同波段辐射会出现不同程度的增强，造成电离层各高度的电子密度不同程度增加，从而使各种电离层产生突然扰动现象，影响高频无线电通信质量甚至使通信中断。近来的研究发现：X5级以上强耀斑会加热中性大气，引起热层大气温度升高及密度增加（Le et al., 2012，20...
"The Effect of Magnesium Coordination on the 13C and 15N Magnetic Resonance Spectra of Chlorophyll a.The Relative Energies of Nitrogen np States as Deduced from a Complete Assignment of Chemical Shifts"
Magnesium Coordination 13C and 15N Magnetic Resonance Spectra Nitrogen np States Complete Assignment Chemical Shifts
2016/5/20
The 5 5 13Cand 4 I5Nnmr transitions in chlorophyll a and its magnesium-free derivative pheophytin a have been assigned. Emphasis is placed on the quaternary carbon atoms of the macrocycle which carry ...
2015年6月11日下午，欧洲激光核物理中心(ELI-NP)学术委员会主任、国际著名核物理和加速器物理学家Sydney Gales教授一行来上海光机所进行学术交流，并作了题为“ELI-NP的发展状况”的学术报告。交流会上，北京师范大学仲加勇教授做了关于磁重联的报告，高功率激光物理联合实验室主任朱健强研究员介绍了神光II系列装置的发展情况。我所30多位科研人员和研究生参加了学术交流。会议由朱健强主持...
研究两类广义控制问题的复杂性: k-步长控制问题和k-距离控制问题, 证明了k-步长控制问题在弦图和平面二部图上都是NP-完全的. 作为上述结果的推论, 给出了k-距离控制问题在弦图和二部图上NP-完全性的新的证明, 并进一步证明了k-距离控制问题在平面二部图上也是NP-完全的.
Study of the Reaction $np \rightarrow np \pi^+ \pi^-$ at Intermediate Energies
Study the Reaction $np \rightarrow np \pi^+ \pi^-$ Intermediate Energies
2011/4/6
Study of the Reaction $np \rightarrow np \pi^+ \pi^-$ at Intermediate Energies 。
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
NP-hardness of Deciding Convexity of Quartic Polynomials Related Problems
2011/1/19
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time)
algorithm that can decide whether a multivariate polynomial of degree four (or higher even
degree) is globa...
Low-Rank Matrix Approximation with Weights or Missing Data is NP-hard
low-rank matrix approximation weighted low-rank approximation missing data
2011/1/17
Weighted low-rank approximation (WLRA), a dimensionality reduction technique for data anal-
ysis, has been successfully used in several applications, such as in collaborative filtering to design reco...
Duality Gap, Computational Complexity and NP Completeness: A Survey
Duality Gap Computational Complexity NP Completeness
2011/2/28
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...
The Search and Study of Low-mass Scalar Mesons in the Reaction $np --> np\pi^+\pi^-$ at Pn=3.83 Gev/c
Search Study of Low-mass Scalar Mesons Reaction
2011/1/4
This work is devoted to search and study scalar 0 0 0 – mesons in the system of
from the react...
Different Adiabatic Quantum Optimization Algorithms for the NP-Complete Exact Cover and 3SAT Problems
Different Adiabatic Quantum Optimization Algorithms the NP-Complete Exact Cover 3SAT Problems
2010/10/29
One of the most important questions in studying quantum computation is: whether a quantum computer can solve NP-complete problems more efficiently than a classical computer? In 2000, adiabatic quantu...
Does Adiabatic Quantum Optimization Truly Fail for NP-complete problems?
Adiabatic Quantum Optimization Truly Fail NP-complete problems
2010/10/29
It has been recently argued that adiabatic quantum optimization would fail in solving NP-complete problems because of the occurrence of exponentially small gaps due to crossing of local minima of the ...
Computational complexity theory is applied to simulations of adiabatic quantum computation, providing predictions about the existence of quantum phase transitions in certain disordered systems. Moreov...
NP-hardness of decoding quantum error correction codes
NP-hardness quantum error correction codes
2010/10/18
Though the theory of quantum error correction is intimately related to the classical coding theory,in particular, one can construct quantum error correction codes (QECCs) from classical codes with the...
I prove that if markets are weak-form efficient, meaning current prices fully reflect all information available in past prices, then P = NP, meaning every computational problem whose solution can be v...