全文获取类型
收费全文 | 1687篇 |
免费 | 111篇 |
国内免费 | 109篇 |
专业分类
化学 | 168篇 |
力学 | 29篇 |
综合类 | 52篇 |
数学 | 1365篇 |
物理学 | 293篇 |
出版年
2024年 | 2篇 |
2023年 | 19篇 |
2022年 | 60篇 |
2021年 | 41篇 |
2020年 | 50篇 |
2019年 | 56篇 |
2018年 | 42篇 |
2017年 | 53篇 |
2016年 | 56篇 |
2015年 | 48篇 |
2014年 | 69篇 |
2013年 | 133篇 |
2012年 | 60篇 |
2011年 | 75篇 |
2010年 | 91篇 |
2009年 | 100篇 |
2008年 | 144篇 |
2007年 | 113篇 |
2006年 | 95篇 |
2005年 | 59篇 |
2004年 | 70篇 |
2003年 | 75篇 |
2002年 | 55篇 |
2001年 | 53篇 |
2000年 | 45篇 |
1999年 | 40篇 |
1998年 | 40篇 |
1997年 | 24篇 |
1996年 | 26篇 |
1995年 | 16篇 |
1994年 | 15篇 |
1993年 | 8篇 |
1992年 | 5篇 |
1991年 | 11篇 |
1990年 | 6篇 |
1989年 | 5篇 |
1988年 | 1篇 |
1987年 | 5篇 |
1986年 | 8篇 |
1985年 | 5篇 |
1984年 | 7篇 |
1983年 | 2篇 |
1982年 | 11篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1971年 | 1篇 |
1957年 | 1篇 |
排序方式: 共有1907条查询结果,搜索用时 15 毫秒
1.
A Necessary and Sufficient Condition for the Existence of a Heterochromatic Spanning Tree in a Graph
Kazuhiro Suzuki 《Graphs and Combinatorics》2006,22(2):261-269
We prove the following theorem. An edge-colored (not necessary to be proper) connected graph G of order n has a heterochromatic spanning tree if and only if for any r colors (1≤r≤n−2), the removal of all the edges colored with these r colors from G results in a graph having at most r+1 components, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors. 相似文献
2.
We study the induced measure obtained from a 1-step Markov measure, supported by a topological Markov chain, after the mapping of the original alphabet onto another one. We give sufficient conditions for the induced measure to be a Gibbs measure (in the sense of Bowen) when the factor system is again a topological Markov chain. This amounts to constructing, when it does exist, the induced potential and proving its Hölder continuity. This is achieved through a matrix method. We provide examples and counterexamples to illustrate our results. 相似文献
3.
Nobuhiro Honda 《Mathematische Nachrichten》2003,256(1):48-57
In a previous paper of the same title the author gave a generalization of the constrution of Donaldson–Friedman, to prove the existence of twistor spaces of n CP 2 with a special kind of divisors. In the present paper, we consider its equivariant version. When n = 3, this gives another proof of the existence of degenerate double solid with C *–action, and we show that the branch quartic surface is birational to an elliptic ruled surface. In case n ≥ 4, this yields new Moishezon twistor spaces with C *–action, which is shown to be the most degenerate ones among twistor spaces studied by Campana and Kreußler. 相似文献
4.
Given a tree
with leaf set X, there are certain ways of arranging the elements of X in a circular order so that
can be embedded in the plane and ‘preserve’ this ordering. We investigate some new combinatorial properties of these ‘circular orderings.’ We then use these properties to establish two results concerning dissimilarity maps on X that are induced by edge-weighted trees with leaf set X. 相似文献
5.
6.
7.
Searching in trees 总被引:1,自引:0,他引:1
Frank Recker 《Discrete Applied Mathematics》2004,140(1-3):169-183
In (Discrete Math. 17 (1977)181) Rivest introduced the search complexity of binary trees and proved that among all binary trees with a fixed search complexity the smallest ones are the so-called Fibonacci trees. This result is extended for q-trees. The structure of the smallest q-trees is again Fibonacci-like but more complicated than in the binary case. In addition an upper bound for the asymptotic growth of these trees is given. 相似文献
8.
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. 相似文献
9.
In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically. 相似文献
10.
Sérgio d'Amorim Santa-Cruz 《Annals of Global Analysis and Geometry》1997,15(4):361-377
We study the hyperkähler geometry of complex adjoint orbits from the point of view of twistor theory. We introduce, for complex semisimple adjoint orbits, the associated spectral curve and construct the twistor space as a union of certain regular adjoint orbits; we also exhibit the family of twistor lines. Furthermore, we show how our methods may be applied for describing hyperkähler metrics associated to more general spectral curves. In particular, we give an algebraic characterisation of the twistor lines. 相似文献