首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11171篇
  免费   307篇
  国内免费   101篇
化学   7437篇
晶体学   99篇
力学   323篇
综合类   1篇
数学   1651篇
物理学   2068篇
  2022年   93篇
  2021年   106篇
  2020年   176篇
  2019年   131篇
  2018年   100篇
  2017年   108篇
  2016年   218篇
  2015年   179篇
  2014年   233篇
  2013年   499篇
  2012年   548篇
  2011年   673篇
  2010年   355篇
  2009年   276篇
  2008年   608篇
  2007年   602篇
  2006年   558篇
  2005年   549篇
  2004年   530篇
  2003年   383篇
  2002年   410篇
  2001年   168篇
  2000年   154篇
  1999年   119篇
  1998年   120篇
  1997年   140篇
  1996年   187篇
  1995年   122篇
  1994年   115篇
  1993年   141篇
  1992年   113篇
  1991年   110篇
  1990年   119篇
  1989年   99篇
  1988年   96篇
  1987年   81篇
  1986年   79篇
  1985年   163篇
  1984年   168篇
  1983年   116篇
  1982年   152篇
  1981年   138篇
  1980年   133篇
  1979年   117篇
  1978年   154篇
  1977年   130篇
  1976年   113篇
  1975年   98篇
  1974年   86篇
  1973年   97篇
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
21.
22.
23.
Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.  相似文献   
24.
25.
In this paper we prove four new (infinite) lists of quadratic inequalities, and four cubic inequalities, for the flag f-vectors of 4-polytopes. These extend and supplement the only four currently known non-linear inequalities, which were proved by Bayer in 1987. The new lists of inequalities for flag f-vectors yield new lists of inequalities for f-vectors of 4-polytopes. Using the latter, we managed to improve an estimate discovered by Hoppner and Ziegler concerning upper bounds of f1 in terms of f0 and f3.  相似文献   
26.
This article provides a status report on discrete mathematics in America's schools, including an overview of publications and programs that have had major impact. It discusses why discrete mathematics should be introduced in the schools and the authors' efforts to advocate, facilitate, and support the adoption of discrete mathematics topics in the schools. Their perspective is that discrete mathematics should be viewed not only as a collection of new and interesting mathematical topics, but, more importantly, as a vehicle for providing teachers with a new way to think about traditional mathematical topics and new strategies for engaging their students in the study of mathematics.  相似文献   
27.
Each convex planar set K has a perimeter C, a minimum width E, an area A, and a diameter D. The set of points (E,C, A1/2, D) corresponding to all such sets is shown to occupy a cone in the non-negative orthant of R4with its vertex at the origin. Its three-dimensional cross section S in the plane D = 1 is investigated. S lies in a rectangular parallelepiped in R3. Results of Lebesgue, Kubota, Fukasawa, Sholander, and Hemmi are used to determine some of the boundary surfaces of S, and new results are given for the other boundary surfaces. From knowledge of S, all inequalities among E, C ,A, and D can be found.  相似文献   
28.
An efficient approach has been developed for the synthesis of an isofervenulin analogue 1 employing a one‐pot condensation‐substitution reaction of a chlorocarboethoxytriazine (electrophile) with a urea (nucleophile). The resulting cyclization reaction resulted in the synthesis of a pyrimido‐heterocycle in good yield in either acidic or basic media. The former was assisted by utilizing trimethylsilyl chloride.  相似文献   
29.
We consider the problem of restructuring an ordered binary tree T, preserving the in-order sequence of its nodes, so as to reduce its height to some target value h. Such a restructuring necessarily involves the downward displacement of some of the nodes of T. Our results, focusing both on the maximum displacement over all nodes and on the maximum displacement over leaves only, provide (i) an explicit tradeoff between the worst-case displacement and the height restriction (including a family of trees that exhibit the worst-case displacements) and (ii) efficient algorithms to achieve height-restricted restructuring while minimizing the maximum node displacement.  相似文献   
30.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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