全文获取类型
收费全文 | 5435篇 |
免费 | 382篇 |
国内免费 | 504篇 |
专业分类
化学 | 382篇 |
晶体学 | 4篇 |
力学 | 204篇 |
综合类 | 89篇 |
数学 | 4305篇 |
物理学 | 1337篇 |
出版年
2024年 | 7篇 |
2023年 | 41篇 |
2022年 | 85篇 |
2021年 | 109篇 |
2020年 | 128篇 |
2019年 | 129篇 |
2018年 | 152篇 |
2017年 | 142篇 |
2016年 | 161篇 |
2015年 | 106篇 |
2014年 | 258篇 |
2013年 | 462篇 |
2012年 | 196篇 |
2011年 | 281篇 |
2010年 | 248篇 |
2009年 | 302篇 |
2008年 | 412篇 |
2007年 | 363篇 |
2006年 | 330篇 |
2005年 | 297篇 |
2004年 | 237篇 |
2003年 | 257篇 |
2002年 | 257篇 |
2001年 | 199篇 |
2000年 | 171篇 |
1999年 | 156篇 |
1998年 | 166篇 |
1997年 | 127篇 |
1996年 | 106篇 |
1995年 | 69篇 |
1994年 | 54篇 |
1993年 | 35篇 |
1992年 | 34篇 |
1991年 | 19篇 |
1990年 | 33篇 |
1989年 | 18篇 |
1988年 | 21篇 |
1987年 | 12篇 |
1986年 | 15篇 |
1985年 | 17篇 |
1984年 | 15篇 |
1983年 | 9篇 |
1982年 | 16篇 |
1981年 | 8篇 |
1980年 | 12篇 |
1979年 | 9篇 |
1978年 | 10篇 |
1977年 | 7篇 |
1976年 | 7篇 |
1973年 | 4篇 |
排序方式: 共有6321条查询结果,搜索用时 31 毫秒
1.
2.
3.
《Journal of Pure and Applied Algebra》2022,226(8):107024
We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation. 相似文献
4.
5.
The growth-fragmentation equation describes a system of growing and dividing particles, and arises in models of cell division, protein polymerisation and even telecommunications protocols. Several important questions about the equation concern the asymptotic behaviour of solutions at large times: at what rate do they converge to zero or infinity, and what does the asymptotic profile of the solutions look like? Does the rescaled solution converge to its asymptotic profile at an exponential speed? These questions have traditionally been studied using analytic techniques such as entropy methods or splitting of operators. In this work, we present a probabilistic approach: we use a Feynman–Kac formula to relate the solution of the growth-fragmentation equation to the semigroup of a Markov process, and characterise the rate of decay or growth in terms of this process. We then identify the Malthus exponent and the asymptotic profile in terms of a related Markov process, and give a spectral interpretation in terms of the growth-fragmentation operator and its dual. 相似文献
6.
《Indagationes Mathematicae》2022,33(1):218-237
We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic , and with coefficients in a field of odd characteristic ): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols. 相似文献
7.
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a -approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers. 相似文献
8.
9.
The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur. 相似文献
10.