全文获取类型
收费全文 | 2166篇 |
免费 | 66篇 |
国内免费 | 181篇 |
专业分类
化学 | 405篇 |
晶体学 | 8篇 |
力学 | 42篇 |
综合类 | 13篇 |
数学 | 1731篇 |
物理学 | 214篇 |
出版年
2024年 | 3篇 |
2023年 | 20篇 |
2022年 | 36篇 |
2021年 | 45篇 |
2020年 | 60篇 |
2019年 | 78篇 |
2018年 | 59篇 |
2017年 | 66篇 |
2016年 | 47篇 |
2015年 | 38篇 |
2014年 | 69篇 |
2013年 | 445篇 |
2012年 | 59篇 |
2011年 | 92篇 |
2010年 | 70篇 |
2009年 | 137篇 |
2008年 | 118篇 |
2007年 | 128篇 |
2006年 | 109篇 |
2005年 | 70篇 |
2004年 | 69篇 |
2003年 | 70篇 |
2002年 | 104篇 |
2001年 | 53篇 |
2000年 | 45篇 |
1999年 | 53篇 |
1998年 | 51篇 |
1997年 | 44篇 |
1996年 | 46篇 |
1995年 | 37篇 |
1994年 | 20篇 |
1993年 | 17篇 |
1992年 | 5篇 |
1991年 | 4篇 |
1990年 | 7篇 |
1989年 | 3篇 |
1988年 | 1篇 |
1987年 | 6篇 |
1986年 | 1篇 |
1985年 | 5篇 |
1984年 | 4篇 |
1983年 | 3篇 |
1982年 | 5篇 |
1981年 | 3篇 |
1980年 | 2篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1973年 | 1篇 |
1970年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有2413条查询结果,搜索用时 31 毫秒
1.
2.
3.
4.
5.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。 相似文献
6.
Yuanqiu Huang 《Discrete Applied Mathematics》2007,155(3):405-409
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree. 相似文献
7.
M.Z. Arslanov 《Operations Research Letters》2007,35(5):636-644
We consider the problem of guillotine cutting a rectangular sheet into two rectangular pieces without rotations. The question is whether there exists a cutting pattern with given numbers of occurrences of both rectangular pieces. A polynomial time algorithm is described to construct the convex hull of solutions to this problem. 相似文献
8.
On Polynomial Functions over Finite Commutative Rings 总被引:1,自引:0,他引:1
Jian Jun JIANG Guo Hua PENG Qi SUN Qi Fan ZHANG 《数学学报(英文版)》2006,22(4):1047-1050
Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained. 相似文献
9.
We construct a new family of cyclic difference sets with parameters ((3
d
– 1)/2, (3
d – 1 – 1)/2, (3
d – 2 – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets. 相似文献
10.
The periodic precipitation pattern formation in gelatinous media is interpreted as a moving boundary problem. The time law,
spacing law and width law are revisited on the basis of the new scenario. The explicit dependence of the geometric structure
on the initial concentrations of the reactants is derived. Matalon—Packter law, which relates the spacing coefficient with
the initial concentrations is reformulated removing many ambiguities and impractical parameters. Experimental results are
discussed to establish the significance of moving boundary concept in the diffusion controlled pattern forming systems 相似文献