全文获取类型
收费全文 | 613篇 |
免费 | 40篇 |
国内免费 | 65篇 |
专业分类
化学 | 29篇 |
力学 | 16篇 |
综合类 | 10篇 |
数学 | 539篇 |
物理学 | 124篇 |
出版年
2024年 | 7篇 |
2023年 | 9篇 |
2022年 | 15篇 |
2021年 | 13篇 |
2020年 | 23篇 |
2019年 | 26篇 |
2018年 | 19篇 |
2017年 | 22篇 |
2016年 | 18篇 |
2015年 | 6篇 |
2014年 | 25篇 |
2013年 | 36篇 |
2012年 | 25篇 |
2011年 | 55篇 |
2010年 | 46篇 |
2009年 | 50篇 |
2008年 | 40篇 |
2007年 | 33篇 |
2006年 | 39篇 |
2005年 | 27篇 |
2004年 | 26篇 |
2003年 | 22篇 |
2002年 | 24篇 |
2001年 | 13篇 |
2000年 | 18篇 |
1999年 | 11篇 |
1998年 | 18篇 |
1997年 | 14篇 |
1996年 | 7篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 1篇 |
1992年 | 2篇 |
1991年 | 1篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1986年 | 4篇 |
1985年 | 1篇 |
1982年 | 1篇 |
1976年 | 4篇 |
排序方式: 共有718条查询结果,搜索用时 15 毫秒
1.
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. 相似文献
2.
The paper discusses the relationship between weights and control vertices of two rational NURBS curves of degree two or three with all weights larger than zero when they represent the same curve parametrically and geometrically, and gives sufficient and necessary conditions for coincidence of two rational NURBS curves in non-degeneracy case. 相似文献
3.
The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique it is shown that, by combining levels of refinement, a preconditioner of optimal order can be constructed for the case of local refinement along a line. Its relative condition number is accurately estimated. Numerical tests demonstrating the performance of the proposed preconditioners will be reported in a forthcoming paper. 相似文献
4.
图G(V,E)的一个k-正常全染色f叫做一个k-点强全染色当且仅当对任意v∈V(G), N[v]中的元素被染不同色,其中N[v]={u|uv∈V(G)}∪{v}.χTvs(G)=min{k|存在图G的k- 点强全染色}叫做图G的点强全色数.对3-连通平面图G(V,E),如果删去面fo边界上的所有点后的图为一个树图,则G(V,E)叫做一个Halin-图.本文确定了最大度不小于6的Halin- 图和一些特殊图的的点强全色数XTvs(G),并提出了如下猜想:设G(V,E)为每一连通分支的阶不小于6的图,则χTvs(G)≤△(G) 2,其中△(G)为图G(V,E)的最大度. 相似文献
5.
Let P(G,λ) be the chromatic polynomial of a graph G with n vertices, independence number α and clique number ω. We show that for every λ≥n, ()α≤≤ ()
n
−ω. We characterize the graphs that yield the lower bound or the upper bound.?These results give new bounds on the mean colour
number μ(G) of G: n− (n−ω)()
n
−ω≤μ(G)≤n−α() α.
Received: December 12, 2000 / Accepted: October 18, 2001?Published online February 14, 2002 相似文献
6.
A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here. 相似文献
7.
给出了半无爪图(quasi-claw-freegraph)点泛圈性方面的两个结果,作为推论,可得到D.Oberly,D.Sumner,L.Clark等人的相关结果. 相似文献
8.
J. Freudenberger 《Discrete Applied Mathematics》2006,154(2):294-304
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and the complexity of this suboptimum list decoding scheme for the binary symmetric channel. The reliability function of the list decoding scheme is equivalent to the sphere-packing bound, where the decoding complexity is asymptotically bounded by 2nR(1-R). Furthermore, we investigate a decision feedback strategy that is based on bounded distance list decoding. Here, any output with zero or many codewords will call for a repeated transmission. In this case the decoding complexity will be of the order 2nR(1-C), where C denotes the channel capacity. The reliability function is close to Forney's feedback exponent. 相似文献
9.
The critical limit of the eight-vertex model eigenvectors obtained by means of the generalized Bethe Ansatz is shown to give the six-vertex eigenvectors as constructed in a previous paper by two of the authors. Furthermore, an explicit mapping is established between these eigenvectors and the usual Bethe Ansatz eigenvectors of the six-vertex model. This allows one to show that the indexv labeling the eight-vertex eigenstates becomes exactly the third component of the total spin in the critical limit. 相似文献
10.
刘红美 《数学的实践与认识》2006,36(8):229-233
基于可选邻接点的概念,在m-ary n-cube网络中提出一种新的最优寻径算法.这种算法始终在当前结点的可选邻接点中选取最空闲邻接点作为下一个信息传输点.该算法使得从源结点到达目的结点路由是最短路由也是最快速路由,而且在多项式时间内可以完成. 相似文献