全文获取类型
收费全文 | 11232篇 |
免费 | 1471篇 |
国内免费 | 645篇 |
专业分类
化学 | 1066篇 |
晶体学 | 27篇 |
力学 | 1139篇 |
综合类 | 406篇 |
数学 | 7537篇 |
物理学 | 3173篇 |
出版年
2024年 | 18篇 |
2023年 | 123篇 |
2022年 | 241篇 |
2021年 | 312篇 |
2020年 | 263篇 |
2019年 | 257篇 |
2018年 | 318篇 |
2017年 | 435篇 |
2016年 | 538篇 |
2015年 | 360篇 |
2014年 | 645篇 |
2013年 | 771篇 |
2012年 | 611篇 |
2011年 | 657篇 |
2010年 | 529篇 |
2009年 | 684篇 |
2008年 | 733篇 |
2007年 | 746篇 |
2006年 | 614篇 |
2005年 | 566篇 |
2004年 | 490篇 |
2003年 | 439篇 |
2002年 | 418篇 |
2001年 | 378篇 |
2000年 | 331篇 |
1999年 | 280篇 |
1998年 | 242篇 |
1997年 | 211篇 |
1996年 | 206篇 |
1995年 | 138篇 |
1994年 | 100篇 |
1993年 | 98篇 |
1992年 | 88篇 |
1991年 | 60篇 |
1990年 | 60篇 |
1989年 | 36篇 |
1988年 | 47篇 |
1987年 | 39篇 |
1986年 | 40篇 |
1985年 | 44篇 |
1984年 | 38篇 |
1983年 | 20篇 |
1982年 | 27篇 |
1981年 | 10篇 |
1980年 | 14篇 |
1979年 | 13篇 |
1978年 | 14篇 |
1977年 | 11篇 |
1976年 | 11篇 |
1959年 | 5篇 |
排序方式: 共有10000条查询结果,搜索用时 171 毫秒
81.
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. 相似文献
82.
The mass spectrum ofcb meson is investigated with an effective quark-antiquark potential of the form -αc/r +Ar
νwith ν varying from 0.5 to 2.0. TheS andP-wave masses, pseudoscalar decay constant, weak decay partial widths in spectator model and the lifetime ofB
cmeson are computed. The properties calculated here are found to be in good agreement with other theoretical and experimental
values at potential index,ν = 1 相似文献
83.
E. Liénard G. Ban J. Blieck D. Durand F. Duval X. Fléchard M. Herbane M. Labalme Y. Lemière F. Mauger A. Méry O. Naviliat-Cuncic D. Rodríguez J. C. Thomas 《Hyperfine Interactions》2006,172(1-3):29-33
We report on the status of the LPCTrap experiment, devoted to measure the β–ν angular correlation in the pure Gamow–Teller
decay of 6He. This measurement is motivated by the search for the presence of tensor type contributions to the weak interaction. The
6He ions are confined in a novel transparent Paul trap. The β particles and the recoil ions are detected in coincidence to
deduce the angular correlation parameter. The commissioning run performed in 2005 has given the proof of principle of this
experiment. Up to 105 coincidences were recorded during a second run in 2006. 相似文献
84.
We prove equivalence of the definitions by the author and by Korevaar and Schoen of the Sobolev classes of mappings of a domain of an arithmetic n-dimensional space to a metric space. 相似文献
85.
86.
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. 相似文献
87.
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. 相似文献
88.
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. 相似文献
89.
Nguyen Minh Chuong Bui Kien Cuong 《Proceedings of the American Mathematical Society》2004,132(12):3589-3597
A class of Cauchy problems for interesting complicated periodic pseudodifferential equations is considered. By the Galerkin-wavelet method and with weak solutions one can find sufficient conditions to establish convergence estimates of weak Galerkin-wavelet solutions to a Cauchy problem for this class of equations.
90.
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. 相似文献