全文获取类型
收费全文 | 1545篇 |
免费 | 66篇 |
国内免费 | 96篇 |
专业分类
化学 | 131篇 |
力学 | 40篇 |
综合类 | 19篇 |
数学 | 1373篇 |
物理学 | 144篇 |
出版年
2023年 | 31篇 |
2022年 | 35篇 |
2021年 | 32篇 |
2020年 | 33篇 |
2019年 | 54篇 |
2018年 | 49篇 |
2017年 | 54篇 |
2016年 | 56篇 |
2015年 | 33篇 |
2014年 | 71篇 |
2013年 | 168篇 |
2012年 | 57篇 |
2011年 | 77篇 |
2010年 | 77篇 |
2009年 | 109篇 |
2008年 | 95篇 |
2007年 | 74篇 |
2006年 | 74篇 |
2005年 | 60篇 |
2004年 | 53篇 |
2003年 | 42篇 |
2002年 | 45篇 |
2001年 | 40篇 |
2000年 | 45篇 |
1999年 | 33篇 |
1998年 | 36篇 |
1997年 | 28篇 |
1996年 | 17篇 |
1995年 | 13篇 |
1994年 | 22篇 |
1993年 | 13篇 |
1992年 | 10篇 |
1991年 | 8篇 |
1990年 | 9篇 |
1989年 | 5篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 4篇 |
1985年 | 7篇 |
1984年 | 6篇 |
1983年 | 2篇 |
1982年 | 4篇 |
1981年 | 5篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1974年 | 1篇 |
1973年 | 2篇 |
排序方式: 共有1707条查询结果,搜索用时 15 毫秒
1.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
2.
Harel and Puri (1989, J. Multivariate Anal. 29) studied the asymptotic behavior of the U-statistic and the one-sample rank order statistic for nonstationary absolutely regular processes. In this note, we present some applications of these results for Markov processes as well as ARMA processes. 相似文献
3.
INTERSECTION OF PRIME SUBMODULES AND DIMENSION OF MODULES 总被引:1,自引:0,他引:1
A.Azizi 《数学物理学报(B辑英文版)》2005,25(3):385-394
The aim of this paper is to study the conditions by which a P-prime submodule can be expressed as a finite intersection or union of P-prime submodules. Also corresponding to dimension and rank of modules, some equivalent conditions for a ring to be a Dedekind domain are given. 相似文献
4.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
5.
A. Azizi 《Czechoslovak Mathematical Journal》2003,53(3):529-534
In this paper we characterize weak multiplication modules. 相似文献
6.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献
7.
Annegret K. Wagler 《4OR: A Quarterly Journal of Operations Research》2005,3(4):329-336
Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete
join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004.
We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004.
Received: November 2004 / Revised version: June 2005 相似文献
8.
9.
Let G be a graph with a nonempty edge set, and with rank rk(G), term rank Rk(G), and chromatic number χ(G). We characterize Rk(G) as being the maximum number of colors in certain proper colorings of G. In particular, we observe that χ(G)Rk(G), with equality holding if and only if (besides isolated vertices) G is either complete or a star. For a twin-free graph G, we observe the bound
and we show that this bound is sharp. 相似文献
10.