首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   359篇
  免费   7篇
  国内免费   3篇
化学   106篇
晶体学   1篇
力学   14篇
数学   197篇
物理学   51篇
  2021年   3篇
  2018年   3篇
  2017年   8篇
  2016年   2篇
  2015年   5篇
  2014年   8篇
  2013年   12篇
  2012年   14篇
  2011年   23篇
  2010年   15篇
  2009年   13篇
  2008年   16篇
  2007年   11篇
  2006年   8篇
  2005年   6篇
  2004年   13篇
  2003年   18篇
  2002年   10篇
  2001年   3篇
  2000年   4篇
  1999年   9篇
  1998年   2篇
  1997年   7篇
  1996年   7篇
  1994年   4篇
  1993年   4篇
  1992年   2篇
  1991年   5篇
  1990年   2篇
  1989年   5篇
  1988年   3篇
  1987年   6篇
  1985年   13篇
  1984年   10篇
  1983年   8篇
  1982年   6篇
  1981年   13篇
  1980年   4篇
  1979年   6篇
  1978年   9篇
  1977年   8篇
  1976年   4篇
  1975年   4篇
  1974年   5篇
  1973年   5篇
  1972年   4篇
  1971年   3篇
  1970年   2篇
  1967年   3篇
  1965年   2篇
排序方式: 共有369条查询结果,搜索用时 125 毫秒
101.
102.
It Is shown here that a permanent of n× ndoubly stochastic matrix is not less than 1/ n!. The proof of this inequality follows from the study of a generalized van der Waerden problem on the set of doubly stochastic matrices.  相似文献   
103.
Let 6x6 be a norm on Cn. For A?Mn(C) denote by 6A6 the induced norm of A, by ?(A) the spectral radius of A. It is proved here that if infp6PAP?16 = ?(A), then 6x6 is a transform absolute norm.  相似文献   
104.
105.
Given P and Q convex compact sets in RkandRs, respectively, and u a continuous real valued function on P × Q, we consider the following pair of dual problems: Problem I—Minimize ? so that ?: P × Q → R and ? ? CavpVexq × max(u, ?). Problem II—Maximize g so that g: P × QR and g ? Vexq × Cavpmin(u, g). Here Cavp is the operation of concavification of a function with respect to the variable p?P (for each fixed q?Q). Similarly, Vexq is the operation of convexification with respect to q?Q. Maximum and minimum are taken here in the partial ordering of pointwise comparison: ? ? g means ?(p, q) ? g(p, q) ?(p, q) ? P × Q. It is proved here that both problems have the same solution which is also the unique simultaneous solution of the following pair of functional equations: (i) ? = Vexqmax(u, ?). (ii) ? = Cavpmin(u, ?). The problem arises in game theory, but the proof here is purely analytical and makes no use of game-theoretical concepts.  相似文献   
106.
107.
Black hole formation is an inevitable consequence of relativistic core collapse following the gravothermal catastrophe in self-interacting dark matter (SIDM) halos. Very massive SIDM halos form supermassive black holes (SMBHs) > or about 10(6)M(middle dot in circle) directly. Smaller halos believed to form by redshift z = 5 produce seed black holes of (10(2)-10(3))M(middle dot in circle) which can merge and/or accrete to reach the observational SMBH range. This scenario for SMBH formation requires no baryons, no prior star formation, and no other black hole seed mechanism.  相似文献   
108.
We show that direct dark-matter detection experiments can distinguish between pointlike and nonpointlike dark-matter candidates. The shape of the nuclear recoil-energy spectrum from pointlike dark-matter particles, e.g., neutralinos, is determined by the velocity distribution of dark matter in the galactic halo and by nuclear form factors. Typical cross sections of nonpointlike dark matter, for example, Q-balls, have a new form factor, which decreases rapidly with the recoil energy. A signal from nonpointlike dark matter is expected to peak near the experimental threshold and to fall off rapidly at higher energies.  相似文献   
109.
k -colorable for some fixed . Our main result is that it is NP-hard to find a 4-coloring of a 3-chromatic graph. As an immediate corollary we obtain that it is NP-hard to color a k-chromatic graph with at most colors. We also give simple proofs of two results of Lund and Yannakakis [20]. The first result shows that it is NP-hard to approximate the chromatic number to within for some fixed ε > 0. We point here that this hardness result applies only to graphs with large chromatic numbers. The second result shows that for any positive constant h, there exists an integer , such that it is NP-hard to decide whether a given graph G is -chromatic or any coloring of G requires colors. Received April 11, 1997/Revised June 10, 1999  相似文献   
110.
The prolongation of lifetimes for an excited atom due to the presence of nearby atoms in the ground state is shown to follow simply from unitarity of the time evolution. We also discuss possible approaches to the detection and the overcoming of various technical obstacles.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号