全文获取类型
收费全文 | 2759篇 |
免费 | 160篇 |
国内免费 | 78篇 |
专业分类
化学 | 79篇 |
晶体学 | 1篇 |
力学 | 5篇 |
综合类 | 29篇 |
数学 | 2752篇 |
物理学 | 131篇 |
出版年
2024年 | 10篇 |
2023年 | 68篇 |
2022年 | 89篇 |
2021年 | 60篇 |
2020年 | 118篇 |
2019年 | 105篇 |
2018年 | 99篇 |
2017年 | 102篇 |
2016年 | 67篇 |
2015年 | 55篇 |
2014年 | 100篇 |
2013年 | 249篇 |
2012年 | 76篇 |
2011年 | 146篇 |
2010年 | 139篇 |
2009年 | 252篇 |
2008年 | 201篇 |
2007年 | 158篇 |
2006年 | 158篇 |
2005年 | 92篇 |
2004年 | 88篇 |
2003年 | 85篇 |
2002年 | 74篇 |
2001年 | 60篇 |
2000年 | 58篇 |
1999年 | 52篇 |
1998年 | 45篇 |
1997年 | 39篇 |
1996年 | 24篇 |
1995年 | 9篇 |
1994年 | 14篇 |
1993年 | 13篇 |
1992年 | 9篇 |
1991年 | 8篇 |
1990年 | 11篇 |
1989年 | 12篇 |
1988年 | 9篇 |
1987年 | 2篇 |
1986年 | 3篇 |
1985年 | 12篇 |
1984年 | 11篇 |
1983年 | 3篇 |
1982年 | 4篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1970年 | 1篇 |
排序方式: 共有2997条查询结果,搜索用时 46 毫秒
81.
82.
Ariane Carrance 《Random Structures and Algorithms》2019,55(3):615-648
We present here random distributions on (D + 1)‐edge‐colored, bipartite graphs with a fixed number of vertices 2p. These graphs encode D‐dimensional orientable colored complexes. We investigate the behavior of those graphs as p→∞. The techniques involved in this study also yield a Central Limit Theorem for the genus of a uniform map of order p, as p→∞. 相似文献
83.
《Discrete Mathematics》2019,342(10):2770-2782
“Which graphs are determined by their spectrum (DS for short)?” is a fundamental question in spectral graph theory. It is generally very hard to show a given graph to be DS and few results about DS graphs are known in literature. In this paper, we consider the above problem in the context of the generalized -spectrum. A graph is said to be determined by the generalized -spectrum (DGQS for short) if, for any graph , and have the same -spectrum and so do their complements imply that is isomorphic to . We give a simple arithmetic condition for a graph being DGQS. More precisely, let be a graph with adjacency matrix and degree diagonal matrix . Let be the signless Laplacian matrix of , and ( is the all-ones vector) be the -walk matrix. We show that if (which is always an integer) is odd and square-free, then is DGQS. 相似文献
84.
85.
86.
We consider four classes of polynomials over the fields , , , , , , , where . We find sufficient conditions on the pairs for which these polynomials permute and we give lower bounds on the number of such pairs. 相似文献
87.
In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3. 相似文献
88.
89.
Magdy H. Metry Allan R. Sampson 《Journal of computational and graphical statistics》2013,22(2):209-223
Abstract This article introduces an approach for characterizing the classes of empirical distributions that satisfy certain positive dependence notions. Mathematically, this can be expressed as studying certain subsets of the class SN of permutations of 1, …, N, where each subset corresponds to some positive dependence notions. Explicit techniques for it-eratively characterizing subsets of SN that satisfy certain positive dependence concepts are obtained and various counting formulas are given. Based on these techniques, graph-theoretic methods are used to introduce new and more efficient algorithms for constructively generating and enumerating the elements of various of these subsets of SN. For example, the class of positively quadrant dependent permutations in SN is characterized in this fashion. 相似文献
90.