全文获取类型
收费全文 | 6688篇 |
免费 | 515篇 |
国内免费 | 669篇 |
专业分类
化学 | 770篇 |
晶体学 | 15篇 |
力学 | 750篇 |
综合类 | 103篇 |
数学 | 4867篇 |
物理学 | 1367篇 |
出版年
2024年 | 16篇 |
2023年 | 85篇 |
2022年 | 169篇 |
2021年 | 138篇 |
2020年 | 210篇 |
2019年 | 201篇 |
2018年 | 173篇 |
2017年 | 210篇 |
2016年 | 193篇 |
2015年 | 148篇 |
2014年 | 260篇 |
2013年 | 546篇 |
2012年 | 317篇 |
2011年 | 394篇 |
2010年 | 348篇 |
2009年 | 505篇 |
2008年 | 479篇 |
2007年 | 465篇 |
2006年 | 391篇 |
2005年 | 357篇 |
2004年 | 278篇 |
2003年 | 268篇 |
2002年 | 236篇 |
2001年 | 189篇 |
2000年 | 188篇 |
1999年 | 177篇 |
1998年 | 194篇 |
1997年 | 150篇 |
1996年 | 123篇 |
1995年 | 62篇 |
1994年 | 58篇 |
1993年 | 47篇 |
1992年 | 48篇 |
1991年 | 36篇 |
1990年 | 23篇 |
1989年 | 21篇 |
1988年 | 23篇 |
1987年 | 19篇 |
1986年 | 19篇 |
1985年 | 13篇 |
1984年 | 20篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 12篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 10篇 |
1977年 | 3篇 |
1974年 | 3篇 |
1972年 | 3篇 |
排序方式: 共有7872条查询结果,搜索用时 15 毫秒
41.
Lingsheng Shi 《Journal of Graph Theory》2005,50(3):175-185
The Ramsey number R(G1,G2) of two graphs G1 and G2 is the least integer p so that either a graph G of order p contains a copy of G1 or its complement Gc contains a copy of G2. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory 相似文献
42.
ZHANG Shu-min 《数学季刊》2004,(2)
In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2). 相似文献
43.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
44.
45.
Dao-sheng Zheng 《计算数学(英文版)》1998,(2)
1.IntroductionSince1984,severalchinesemathematicianshaveobtailledmanyresultsboutmatrixoperatornormcondition.umbe.[ll'12'18].Twokindsmatrixconditionnllmbers[9]are:(1)IfAECoxsisnonsingular,thellunlberK.(A)~IIAll.llA--'if.iscalledtheor--normconditionnumberof… 相似文献
46.
A layer of stratified combination composed of selected radiation shielding materials acquires better shielding property. Albedo
is used in such measurements as an integral measure ofγ-ray scattering. The stratified slabs of alternating heterogeneous layers have been found to have a virtual homogeneous property
with a definite effective atomic number. The angular distribution of back-scattered photons as well as the total number albedo
values for iron, aluminium and concrete in stratified combination for 662 keV and 1250 keV photons are reported. 相似文献
47.
Pierre L'Ecuyer 《Annals of Operations Research》1994,53(1):77-120
In typical stochastic simulations, randomness is produced by generating a sequence of independent uniform variates (usually real-valued between 0 and 1, or integer-valued in some interval) and transforming them in an appropriate way. In this paper, we examine practical ways of generating (deterministic approximations to) such uniform variates on a computer. We compare them in terms of ease of implementation, efficiency, theoretical support, and statistical robustness. We look in particular at several classes of generators, such as linear congruential, multiple recursive, digital multistep, Tausworthe, lagged-Fibonacci, generalized feedback shift register, matrix, linear congruential over fields of formal series, and combined generators, and show how all of them can be analyzed in terms of their lattice structure. We also mention other classes of generators, like non-linear generators, discuss other kinds of theoretical and empirical statistical tests, and give a bibliographic survey of recent papers on the subject. 相似文献
48.
49.
50.