全文获取类型
收费全文 | 43040篇 |
免费 | 3279篇 |
国内免费 | 1987篇 |
专业分类
化学 | 21476篇 |
晶体学 | 147篇 |
力学 | 1460篇 |
综合类 | 972篇 |
数学 | 12069篇 |
物理学 | 12182篇 |
出版年
2023年 | 311篇 |
2022年 | 1455篇 |
2021年 | 1628篇 |
2020年 | 795篇 |
2019年 | 925篇 |
2018年 | 725篇 |
2017年 | 893篇 |
2016年 | 1170篇 |
2015年 | 1108篇 |
2014年 | 1613篇 |
2013年 | 2462篇 |
2012年 | 1696篇 |
2011年 | 1936篇 |
2010年 | 1791篇 |
2009年 | 2327篇 |
2008年 | 2475篇 |
2007年 | 2633篇 |
2006年 | 1990篇 |
2005年 | 1358篇 |
2004年 | 1244篇 |
2003年 | 1251篇 |
2002年 | 3716篇 |
2001年 | 1409篇 |
2000年 | 931篇 |
1999年 | 772篇 |
1998年 | 776篇 |
1997年 | 571篇 |
1996年 | 615篇 |
1995年 | 522篇 |
1994年 | 503篇 |
1993年 | 560篇 |
1992年 | 546篇 |
1991年 | 348篇 |
1990年 | 316篇 |
1989年 | 270篇 |
1988年 | 285篇 |
1987年 | 206篇 |
1986年 | 228篇 |
1985年 | 342篇 |
1984年 | 254篇 |
1983年 | 164篇 |
1982年 | 307篇 |
1981年 | 470篇 |
1980年 | 428篇 |
1979年 | 474篇 |
1978年 | 379篇 |
1977年 | 288篇 |
1976年 | 239篇 |
1974年 | 108篇 |
1973年 | 192篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
161.
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. 相似文献
162.
A new sample business survey for agriculture, the REA survey, and a project of integration with the FADN network (RICA in
Italy) have significantly changed the production of statistical information nowadays available with reference to the agricultural
sector. On the basis of this relevant information, new economic analyses are being developed on farms’ performance, agricultural
households’ income and the Common Agricultural Policy (CAP). In this paper the authors estimate the relationship between the
levels of variables of interest and their sampling errors using models in order to improve the accessibility of the information
on estimates accuracy to the final users (agricultural analysts, policy makers).
The paper is the result of a joint research of the three authors. Sections 1–3 and 6 by Pizzoli, Sects. 4 and 5 by Rondinelli,
Sect. 7 by Filiberti, conclusions joint to the three authors. 相似文献
163.
Jan P. Boroński 《Topology and its Applications》2007,154(18):3156-3166
A set (or a collection of sets) contained in the Euclidean space Rm is symmetric if it is invariant under the antipodal map. Given a symmetric unicoherent polyhedron X (like an n-dimensional cube or a sphere) and an odd real function f defined on vertices of a certain symmetric triangulation of X, we algorithmically construct a connected symmetric separator of X by choosing a subcollection of the triangulation. Each element of the subcollection contains the vertices v and u such that f(v)f(u)?0. 相似文献
164.
Michael Holcomb 《Topology and its Applications》2007,154(1):124-143
One can form a polygonal linkage by identifying initial and terminal points of two free linkages. Likewise, one can form a multipolygonal linkage by identifying initial and terminal points of three free linkages. The geometric and topological properties of moduli spaces of multipolygonal linkages in the plane are studied. These spaces are compact algebraic varieties. Some conditions under which these spaces are smooth manifolds, cross products or disjoint unions of moduli spaces of polygonal linkages, or connected, are determined. Dimensions in smooth manifold cases and some Euler characteristics are computed. A classification of generic multiquadrilateral linkages is also made. 相似文献
165.
We investigate separability questions for the mapping class group of a surface. While this group is not subgroup separable in general, we prove a large family of interesting subgroups are separable. This includes many classically studied subgroups such as solvable subgroups, Heegaard and Handlebody groups, geometric subgroups, and all the terms in the Johnson filtration. 相似文献
166.
New criteria are provided for determining whether an integral representation of a stable process is minimal. These criteria are based on various nonminimal sets and their projections, and have several advantages over and shed light on already available criteria. In particular, they naturally lead from a nonminimal representation to the one which is minimal. Several known examples are considered to illustrate the main results. The general approach is also adapted to show that the so-called mixed moving averages have a minimal integral representation of the mixed moving average type. 相似文献
167.
Bing-sheng He Zhen-hua Yang Xiao-ming Yuan 《Journal of Mathematical Analysis and Applications》2004,300(2):139-374
Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method. 相似文献
168.
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. 相似文献
169.
Gabriela Jeronimo Teresa Krick Juan Sabia Martín Sombra 《Foundations of Computational Mathematics》2004,4(1):41-117
We present a bounded probability algorithm for the computation of the
Chowforms of the equidimensional components of an algebraic variety. In particular,
this gives an alternative procedure for the effective equidimensional decomposition
of the variety, since each equidimensional component is characterized by its Chow
form.
The expected complexity of the algorithm is polynomial in the size and the geometric
degree of the input equation system defining the variety. Hence it improves (or
meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects,
which constitutes a further contribution of the paper.
The algorithm is based on elimination theory techniques, in line with the geometric
resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators.
In fact, ours can be considered as an extension of their algorithm for zero-dimensional
systems to the case of positive-dimensional varieties. The key element for dealing
with positive-dimensional varieties is a new Poisson-type product formula. This
formula allows us to compute the Chow form of an equidimensional variety from a
suitable zero-dimensional fiber.
As an application, we obtain an algorithm to compute a subclass of sparse resultants,
whose complexity is polynomial in the dimension and the volume of the input
set of exponents. As another application, we derive an algorithm for the computation
of the (unique) solution of a generic overdetermined polynomial equation system. 相似文献
170.
Binary Decision Diagrams (BDDs) are the state-of-the-art data structure for representation and manipulation of Boolean functions. In general, exact BDD minimization is NP-complete. For BDD-based technology, a small improvement in the number of nodes often simplifies the follow-up problem tremendously. This paper proposes an elitism-based evolutionary algorithm (EBEA) for BDD minimization. It can efficiently find the optimal orderings of variables for all LGSynth91 benchmark circuits with a known minimum size. Moreover, we develop a distributed model of EBEA, DEBEA, which obtains the best-ever variable orders for almost all benchmarks in the LGSynth91. Experimental results show that DEBEA is able to achieve super-linear performance compared to EBEA for some hard benchmarks. 相似文献