全文获取类型
收费全文 | 5020篇 |
免费 | 322篇 |
国内免费 | 450篇 |
专业分类
化学 | 1247篇 |
晶体学 | 9篇 |
力学 | 62篇 |
综合类 | 91篇 |
数学 | 3880篇 |
物理学 | 503篇 |
出版年
2024年 | 5篇 |
2023年 | 75篇 |
2022年 | 136篇 |
2021年 | 143篇 |
2020年 | 139篇 |
2019年 | 180篇 |
2018年 | 164篇 |
2017年 | 156篇 |
2016年 | 153篇 |
2015年 | 96篇 |
2014年 | 244篇 |
2013年 | 488篇 |
2012年 | 195篇 |
2011年 | 311篇 |
2010年 | 250篇 |
2009年 | 354篇 |
2008年 | 350篇 |
2007年 | 317篇 |
2006年 | 286篇 |
2005年 | 229篇 |
2004年 | 209篇 |
2003年 | 203篇 |
2002年 | 169篇 |
2001年 | 126篇 |
2000年 | 128篇 |
1999年 | 102篇 |
1998年 | 117篇 |
1997年 | 64篇 |
1996年 | 80篇 |
1995年 | 51篇 |
1994年 | 38篇 |
1993年 | 31篇 |
1992年 | 25篇 |
1991年 | 21篇 |
1990年 | 12篇 |
1989年 | 19篇 |
1988年 | 13篇 |
1987年 | 11篇 |
1986年 | 15篇 |
1985年 | 24篇 |
1984年 | 13篇 |
1983年 | 5篇 |
1982年 | 9篇 |
1981年 | 8篇 |
1980年 | 9篇 |
1979年 | 4篇 |
1978年 | 5篇 |
1977年 | 3篇 |
1976年 | 3篇 |
1936年 | 1篇 |
排序方式: 共有5792条查询结果,搜索用时 15 毫秒
21.
THE RADICALS OF HOPF MODULE ALGEBRAS 总被引:1,自引:0,他引:1
Zhang Shouchuan 《数学年刊B辑(英文版)》1997,18(4):495-502
THERADICALSOFHOPFMODULEALGEBRASZHANGSHOUCHUAN*AbstractThecharacterizationofH-primeradicalisgiveninmanyways.Meantime,therelati... 相似文献
22.
Alexander Afriat 《Foundations of Physics Letters》1995,8(5):467-480
We consider the question of factorizability in tensor product spaces, and argue that the correlations associated with entangled states are even more problematic in the general case involving any tensor product of Hilbert spaces, than in the Einstein, Podolsky, and Rosen case with only two [1]. 相似文献
23.
A generalization of strong regularity around a vertex subset C of a graph Γ, which makes sense even if Γis non-regular, is studied. Such a structure appears, together with a kind of distance-regularity around C , when an spectral bound concerning the so-called predistance polynomial of C is attained. As a main consequence of these results, it is shown that a regular (connected) graph Γwith d + 1 distinct eigenvalues is distance-regular, and its distance- d graph Γ d is strongly regular with parameters a = c , if and only if the number of vertices at distance d from each vertex satisfies an expression which depends only on the order of Γand the different eigenvalues of Γ. 相似文献
24.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
25.
Let G=(V,E) be a undirected k-edge connected graph with weights ce on edges and wv on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable. 相似文献
26.
Brian Lucena 《Discrete Applied Mathematics》2007,155(8):1055-1065
One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors. 相似文献
27.
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. 相似文献
28.
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度. 相似文献
29.
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. 相似文献
30.
We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel. 相似文献