全文获取类型
收费全文 | 1412篇 |
免费 | 53篇 |
国内免费 | 117篇 |
专业分类
化学 | 26篇 |
力学 | 23篇 |
综合类 | 28篇 |
数学 | 1435篇 |
物理学 | 70篇 |
出版年
2023年 | 12篇 |
2022年 | 22篇 |
2021年 | 22篇 |
2020年 | 28篇 |
2019年 | 38篇 |
2018年 | 35篇 |
2017年 | 29篇 |
2016年 | 22篇 |
2015年 | 22篇 |
2014年 | 52篇 |
2013年 | 179篇 |
2012年 | 52篇 |
2011年 | 67篇 |
2010年 | 62篇 |
2009年 | 118篇 |
2008年 | 101篇 |
2007年 | 95篇 |
2006年 | 78篇 |
2005年 | 58篇 |
2004年 | 52篇 |
2003年 | 55篇 |
2002年 | 52篇 |
2001年 | 41篇 |
2000年 | 53篇 |
1999年 | 46篇 |
1998年 | 33篇 |
1997年 | 38篇 |
1996年 | 30篇 |
1995年 | 20篇 |
1994年 | 16篇 |
1993年 | 10篇 |
1992年 | 3篇 |
1991年 | 3篇 |
1990年 | 8篇 |
1989年 | 5篇 |
1987年 | 2篇 |
1985年 | 6篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有1582条查询结果,搜索用时 453 毫秒
1.
2.
3.
本文对一类具有对称轴的图A_n(n≥0),得到了它的特征多项式及匹配多项式的精确表达式;同时还得到A_(?)的完美匹配数。 相似文献
4.
Summary It is shown that the outer automorphism group of a Coxeter groupW of finite rank is finite if the Coxeter graph contains no infinite bonds. A key step in the proof is to show that if the
group is irreducible andΠ
1 andΠ
2 any two bases of the root system ofW, thenΠ
2 = ±ωΠ
1 for some ω εW. The proof of this latter fact employs some properties of the dominance order on the root system introduced by Brink and
Howlett.
This article was processed by the author using the Springer-Verlag TEX PJour1g macro package 1991. 相似文献
5.
Michael Giudici 《Designs, Codes and Cryptography》2006,39(2):163-172
We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial
cosets of E in C.
Michael Giudici - The author holds an Australian Postdoctoral Fellowship. 相似文献
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.
In this paper we extend a result of Semrl stating that every 2-local automorphism of the full operator algebra on a separable infinite dimensional Hilbert space is an automorphism. In fact, besides separable Hilbert spaces, we obtain the same conclusion for the much larger class of Banach spaces with Schauder bases. The proof rests on an analogous statement concerning the 2-local automorphisms of matrix algebras for which we present a short proof. The need to get such a proof was formulated in Semrl's paper.
10.
In this article, a kind of auxiliary design BSA* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007 相似文献