全文获取类型
收费全文 | 7903篇 |
免费 | 793篇 |
国内免费 | 711篇 |
专业分类
化学 | 1346篇 |
晶体学 | 36篇 |
力学 | 908篇 |
综合类 | 142篇 |
数学 | 4897篇 |
物理学 | 2078篇 |
出版年
2024年 | 12篇 |
2023年 | 94篇 |
2022年 | 212篇 |
2021年 | 172篇 |
2020年 | 246篇 |
2019年 | 229篇 |
2018年 | 223篇 |
2017年 | 274篇 |
2016年 | 248篇 |
2015年 | 176篇 |
2014年 | 312篇 |
2013年 | 595篇 |
2012年 | 358篇 |
2011年 | 458篇 |
2010年 | 388篇 |
2009年 | 559篇 |
2008年 | 542篇 |
2007年 | 500篇 |
2006年 | 440篇 |
2005年 | 415篇 |
2004年 | 334篇 |
2003年 | 316篇 |
2002年 | 608篇 |
2001年 | 248篇 |
2000年 | 211篇 |
1999年 | 203篇 |
1998年 | 209篇 |
1997年 | 158篇 |
1996年 | 127篇 |
1995年 | 75篇 |
1994年 | 64篇 |
1993年 | 50篇 |
1992年 | 53篇 |
1991年 | 43篇 |
1990年 | 28篇 |
1989年 | 26篇 |
1988年 | 25篇 |
1987年 | 24篇 |
1986年 | 19篇 |
1985年 | 14篇 |
1984年 | 23篇 |
1983年 | 6篇 |
1982年 | 11篇 |
1981年 | 10篇 |
1980年 | 9篇 |
1979年 | 11篇 |
1978年 | 11篇 |
1972年 | 3篇 |
1971年 | 12篇 |
1970年 | 9篇 |
排序方式: 共有9407条查询结果,搜索用时 15 毫秒
41.
Chen Hao 《中国科学A辑(英文版)》2006,49(5):715-720
In this paper, for the the primes p such that 3 is a divisor of p − 1, we prove a result which reduces the computation of the linear complexity of a sequence over GF(p
m) (any positive integer m) with the period 3n (n and p
m − 1 are coprime) to the computation of the linear complexities of three sequences with the period n. Combined with some known algorithms such as generalized Games-Chan algorithm, Berlekamp-Massey algorithm and Xiao-Wei-Lam-Imamura
algorithm, we can determine the linear complexity of any sequence over GF(p
m) with the period 3n (n and p
m
− 1 are coprime) more efficiently. 相似文献
42.
Matthias Kriesell 《Graphs and Combinatorics》2002,18(1):133-146
Let k≤n be positive integers. A finite, simple, undirected graph is called k-critically n-connected, or, briefly, an (n,k)-graph, if it is noncomplete and n-connected and the removal of any set X of at most k vertices results in a graph which is not (n−|X|+1)-connected. We present some new results on the number of vertices of an (n,k)-graph, depending on new estimations of the transversal number of a uniform hypergraph with a large independent edge set.
Received: April 14, 2000 Final version received: May 8, 2001 相似文献
43.
This paper proposes the Rice condition numbers for invariant subspace, singular sub-spaces of a matrix and deflating subspaces of a regular matrix pair. The first-order perturbation estimations for these subspaces are derived by applying perturbation expansions of orthogonal projection operators. 相似文献
44.
Xuechao Li 《Graphs and Combinatorics》2006,22(4):503-513
In this paper, we give new lower bounds for the size of Δ-critical graphs with Δ=8,9 which improve the partial results of
Luo [6] and Y. Zhao [12]. 相似文献
45.
连通图的离散度是用s(G)来表示的,s(G)=max{ω(G-S)-|S|:ω(G-S)>1,SV(G)}.给出了两个完全图乘积的和一个完全图与路的乘积的离散度.还给出了两个完全图乘积的坚韧度. 相似文献
46.
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. 相似文献
47.
Let E
n:y
2=x
3−n
2
x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups
associated with E
n
to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E
n.
2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90 相似文献
48.
Eckhard Steffen 《Discrete Mathematics》2004,280(1-3):191-214
Cubic bridgeless graphs with chromatic index four are called uncolorable. We introduce parameters measuring the uncolorability of those graphs and relate them to each other. For k=2,3, let ck be the maximum size of a k-colorable subgraph of a cubic graph G=(V,E). We consider r3=|E|−c3 and
. We show that on one side r3 and r2 bound each other, but on the other side that the difference between them can be arbitrarily large. We also compare them to the oddness ω of G, the smallest possible number of odd circuits in a 2-factor of G. We construct cyclically 5-edge connected cubic graphs where r3 and ω are arbitrarily far apart, and show that for each 1c<2 there is a cubic graph such that ωcr3. For k=2,3, let ζk denote the largest fraction of edges that can be k-colored. We give best possible bounds for these parameters, and relate them to each other. 相似文献
49.
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. 相似文献
50.
Shunsuke Inenaga Ayumi Shinohara Masayuki Takeda Setsuo Arikawa 《Journal of Discrete Algorithms》2004,2(1):33
Suffix trees are a well-known and widely-studied data structure highly useful for string matching. The suffix tree of a string w can be constructed in O(n) time and space, where n denotes the length of w. Larsson achieved an efficient algorithm to maintain suffix trees for a sliding window. It contributes to prediction by partial matching (PPM) style statistical data compression scheme. Compact directed acyclic word graphs (CDAWGs) are a more space-economical data structure for indexing strings. In this paper we propose a linear-time algorithm to maintain CDAWGs for a sliding window. 相似文献