全文获取类型
收费全文 | 14791篇 |
免费 | 1510篇 |
国内免费 | 1372篇 |
专业分类
化学 | 3511篇 |
晶体学 | 52篇 |
力学 | 991篇 |
综合类 | 352篇 |
数学 | 9642篇 |
物理学 | 3125篇 |
出版年
2024年 | 20篇 |
2023年 | 146篇 |
2022年 | 198篇 |
2021年 | 335篇 |
2020年 | 405篇 |
2019年 | 436篇 |
2018年 | 409篇 |
2017年 | 461篇 |
2016年 | 594篇 |
2015年 | 399篇 |
2014年 | 718篇 |
2013年 | 1264篇 |
2012年 | 651篇 |
2011年 | 893篇 |
2010年 | 793篇 |
2009年 | 930篇 |
2008年 | 963篇 |
2007年 | 948篇 |
2006年 | 877篇 |
2005年 | 757篇 |
2004年 | 675篇 |
2003年 | 686篇 |
2002年 | 634篇 |
2001年 | 473篇 |
2000年 | 486篇 |
1999年 | 391篇 |
1998年 | 339篇 |
1997年 | 314篇 |
1996年 | 265篇 |
1995年 | 201篇 |
1994年 | 153篇 |
1993年 | 135篇 |
1992年 | 111篇 |
1991年 | 110篇 |
1990年 | 57篇 |
1989年 | 55篇 |
1988年 | 56篇 |
1987年 | 30篇 |
1986年 | 37篇 |
1985年 | 34篇 |
1984年 | 40篇 |
1983年 | 20篇 |
1982年 | 26篇 |
1981年 | 31篇 |
1980年 | 26篇 |
1979年 | 20篇 |
1978年 | 18篇 |
1977年 | 17篇 |
1976年 | 10篇 |
1973年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 31 毫秒
71.
用三个关系式与Mathematica软件求第二类自然数幂和公式 总被引:1,自引:1,他引:0
首先介绍三个第二类自然数幂和关系式并对其中的两式给出证明,接着利用这些关系式与数学软件M athem atica4.0,给出求解第二类自然数幂和公式的若干机械计算方法. 相似文献
72.
Let G be a graph and let Pm(G) denote the number of perfect matchings of G.We denote the path with m vertices by Pm and the Cartesian product of graphs G and H by G×H. In this paper, as the continuance of our paper [W. Yan, F. Zhang, Enumeration of perfect matchings of graphs with reflective symmetry by Pfaffians, Adv. Appl. Math. 32 (2004) 175-188], we enumerate perfect matchings in a type of Cartesian products of graphs by the Pfaffian method, which was discovered by Kasteleyn. Here are some of our results:1. Let T be a tree and let Cn denote the cycle with n vertices. Then Pm(C4×T)=∏(2+α2), where the product ranges over all eigenvalues α of T. Moreover, we prove that Pm(C4×T) is always a square or double a square.2. Let T be a tree. Then Pm(P4×T)=∏(1+3α2+α4), where the product ranges over all non-negative eigenvalues α of T.3. Let T be a tree with a perfect matching. Then Pm(P3×T)=∏(2+α2), where the product ranges over all positive eigenvalues α of T. Moreover, we prove that Pm(C4×T)=[Pm(P3×T)]2. 相似文献
73.
R. Thomas conjectured, 20 years ago, that the presence of a positive circuit in the interaction graph of a dynamical system is a necessary condition for the presence of several stable states. Recently, E. Remy et al. stated and proved the conjecture for Boolean dynamical systems. Using a similar approach, we generalize the result to discrete dynamical systems, and by focusing on the asynchronous dynamics that R. Thomas used in the course of his analysis of genetic networks, we obtain a more general variant of R. Thomas’ conjecture. In this way, we get a necessary condition for genetic networks to lead to differentiation. 相似文献
74.
关于矩阵和算子迹的一组不等式 总被引:1,自引:1,他引:0
周其生 《数学的实践与认识》2006,36(3):252-256
给出关于半正定矩阵迹和正算子迹的一组不等式,得到与邱贤忠关于实数的不等式的类似结果. 相似文献
75.
We prove that for any given c, 1 < c < 17/11, almost all natural numbers are representable in the form [x
c] + [p
c], where x is a natural number and p is a prime. 相似文献
76.
77.
Cao H. P. Chen G. Grechkoseeva M. A. Mazurov V. D. Shi W. J. Vasil'ev A. V. 《Siberian Mathematical Journal》2004,45(6):1031-1035
The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F
4(2
m
) is recognizable by spectrum. 相似文献
78.
79.
Juan Gonzá lez-Meneses Luis Paris 《Transactions of the American Mathematical Society》2004,356(1):219-243
We show that Vassiliev invariants separate braids on a closed oriented surface, and we exhibit a universal Vassiliev invariant for these braids in terms of chord diagrams labeled by elements of the fundamental group of the surface.
80.
In this paper, three new direct Mutually Orthogonal Latin Squares (MOLS) constructions are presented for 7 MOLS(24), 7 MOLS(75) and 8 MOLS(36); then using recursive methods, several new constructions for 7 and 8 MOLS are obtained. These reduce the largest value for which 7 MOLS are unknown from 780 to 570, and the largest odd value for which 8 MOLS are unknown from 1935 to 419. © 2003 Wiley Periodicals, Inc. 相似文献