全文获取类型
收费全文 | 720篇 |
免费 | 73篇 |
国内免费 | 61篇 |
专业分类
化学 | 125篇 |
晶体学 | 4篇 |
力学 | 49篇 |
综合类 | 14篇 |
数学 | 513篇 |
物理学 | 149篇 |
出版年
2023年 | 4篇 |
2022年 | 8篇 |
2021年 | 12篇 |
2020年 | 18篇 |
2019年 | 19篇 |
2018年 | 11篇 |
2017年 | 20篇 |
2016年 | 24篇 |
2015年 | 23篇 |
2014年 | 44篇 |
2013年 | 53篇 |
2012年 | 26篇 |
2011年 | 37篇 |
2010年 | 36篇 |
2009年 | 40篇 |
2008年 | 57篇 |
2007年 | 59篇 |
2006年 | 46篇 |
2005年 | 29篇 |
2004年 | 35篇 |
2003年 | 28篇 |
2002年 | 29篇 |
2001年 | 24篇 |
2000年 | 21篇 |
1999年 | 23篇 |
1998年 | 24篇 |
1997年 | 21篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 8篇 |
1993年 | 4篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 6篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 3篇 |
1974年 | 1篇 |
1973年 | 1篇 |
1962年 | 1篇 |
排序方式: 共有854条查询结果,搜索用时 15 毫秒
11.
关于Ramsey数下界的部分结果 总被引:3,自引:1,他引:2
刘富贵 《数学的实践与认识》2002,32(1):97-99
本文得到 Ramsey数下界的一个计算公式 :R( l,s+ t-2 )≥ R( l,s) + R( l,t) -1 ,(式中 l、s、t≥ 3) .用此公式算得的 Ramsey数的下界比用其它公式算得的下界好 . 相似文献
12.
We see that the entropy method yields strong concentration results for general self‐bounding functions of independent random variables. These give an improvement of a concentration result of Talagrand much used in discrete mathematics. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2006 相似文献
13.
Martin Weese 《Mathematical Logic Quarterly》1992,38(1):325-326
14.
We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem. 相似文献
15.
Periodica Mathematica Hungarica - Let X 1,X 2,... be a sequence of independent and identically distributed random variables, and put % MATHTYPE!MTEF!2!1!+-%... 相似文献
16.
G. Sreenivasulu Reddy J. Hanumanthachari T. Vasanthi 《Southeast Asian Bulletin of Mathematics》2003,26(2):331-335
This paper is mainly dealt with the structure of totally ordered rings (t.o. rings) whose positive cones are finitely generated as multiplicative right ideals.AMS Subject Classification (1991): 16W80, 13J25 相似文献
17.
U.Deva Priyakumar 《Tetrahedron letters》2004,45(12):2495-2498
A novel preference for planar tetracoordination was observed over the conventional tetrahedral arrangement in a new series of C5H2, C5H4, C5H41+/2+ and related compounds. The stability of these molecules is assessed with the ring-opening barriers, HOMO-LUMO gap, singlet-triplet energy differences and nucleus independent chemical shift values. 相似文献
18.
Michel Vasquez 《Journal of Heuristics》2004,10(4):407-413
For the Queens_n
2 graph coloring problems no chromatic numbers are available for n > 9 except where n is not a multiple of 2 or 3. In this paper we propose an exact algorithm that takes advantage of the particular structure of these graphs. The algorithm works on the independent sets of the graph rather than on the vertices to be colored. It combines branch and bound, for independent set assignment, with a clique based filtering procedure. A first experimentation of this approach provided the coloring number values ranging for n = 10 to n = 14. 相似文献
19.
We first note that Gentzen's proof-reduction for his consistency proof of PA can be directly interpreted as moves of Kirby-Paris' Hydra Game, which implies a direct independence proof of the game (Section 1 and Appendix). Buchholz's Hydra Game for labeled hydras is known to be much stronger than PA. However, we show that the one-dimensional version of Buchholz's Game can be exactly identified to Kirby-Paris' Game (which is two-dimensional but without labels), by a simple and natural interpretation (Section 2). Jervell proposed another type of a combinatorial game, by abstracting Gentzen's proof-reductions and showed that his game is independent of PA. We show (Section 3) that this Jervell's game is actually much stronger than PA, by showing that the critical ordinal of Jervell's game is φω (0) (while that of PA or of Kirby-Paris' Game is φ1 (0) = ?0) in the Veblen hierarchy of ordinals. 相似文献
20.
报道了600MeV(18)O轰击(nat)Ph(厚靶)生成的质量数在180—209之间的Hg同位素产物独立截面的测量结果.通过与600MeV质子轰击天然铅靶生成Hg同位素产额分布的比较,讨论了几个质量区段Hg同位素的生成机制.测量结果也与相对论重离子碎裂反应双质子移出道的产额分布进行了比较.结果表明,中能重离子与中子较富集靶核组成的反应系统对生成丰中子类靶余核具有较明显的优势. 相似文献