全文获取类型
收费全文 | 7581篇 |
免费 | 336篇 |
国内免费 | 484篇 |
专业分类
化学 | 162篇 |
力学 | 594篇 |
综合类 | 45篇 |
数学 | 6651篇 |
物理学 | 949篇 |
出版年
2024年 | 15篇 |
2023年 | 104篇 |
2022年 | 109篇 |
2021年 | 99篇 |
2020年 | 196篇 |
2019年 | 214篇 |
2018年 | 198篇 |
2017年 | 185篇 |
2016年 | 193篇 |
2015年 | 165篇 |
2014年 | 337篇 |
2013年 | 806篇 |
2012年 | 295篇 |
2011年 | 460篇 |
2010年 | 380篇 |
2009年 | 570篇 |
2008年 | 557篇 |
2007年 | 488篇 |
2006年 | 387篇 |
2005年 | 325篇 |
2004年 | 266篇 |
2003年 | 307篇 |
2002年 | 226篇 |
2001年 | 195篇 |
2000年 | 211篇 |
1999年 | 188篇 |
1998年 | 169篇 |
1997年 | 167篇 |
1996年 | 127篇 |
1995年 | 77篇 |
1994年 | 75篇 |
1993年 | 37篇 |
1992年 | 31篇 |
1991年 | 28篇 |
1990年 | 26篇 |
1989年 | 23篇 |
1988年 | 17篇 |
1987年 | 19篇 |
1986年 | 12篇 |
1985年 | 27篇 |
1984年 | 12篇 |
1983年 | 10篇 |
1982年 | 12篇 |
1981年 | 11篇 |
1980年 | 13篇 |
1979年 | 5篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1975年 | 4篇 |
1973年 | 3篇 |
排序方式: 共有8401条查询结果,搜索用时 31 毫秒
1.
《Discrete Mathematics》2022,345(10):112984
Let G be a generalized dicyclic group with identity 1. An inverse closed subset S of is called minimal if and there exists some such that . In this paper, we characterize distance-regular Cayley graphs of G under the condition that S is minimal. 相似文献
2.
Clemens G. Raab Georg Regensburger Jamal Hossein Poor 《Journal of Pure and Applied Algebra》2021,225(5):106564
A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials. 相似文献
3.
4.
《Indagationes Mathematicae》2022,33(4):801-815
We consider the irreducibility of polynomial where is a negative integer. We observe that the constant term of vanishes if and only if . Therefore we assume that where is a non-negative integer. Let and more general polynomial, let where with are integers such that . Schur was the first to prove the irreducibility of for . It has been proved that is irreducible for . In this paper, by a different method, we prove: Apart from finitely many explicitly given possibilities, either is irreducible or is linear factor times irreducible polynomial. This is a consequence of the estimate whenever has a factor of degree and . This sharpens earlier estimates of Shorey and Tijdeman and Nair and Shorey. 相似文献
5.
In this paper, we study generalized Douglas–Weyl(α, β)-metrics. Suppose that a regular(α, β)-metric F is not of Randers type. We prove that F is a generalized Douglas–Weyl metric with vanishing S-curvature if and only if it is a Berwald metric. Moreover, by ignoring the regularity, if F is not a Berwald metric, then we find a family of almost regular Finsler metrics which is not Douglas nor Weyl. As its application, we show that generalized Douglas–Weyl square metric or Matsumoto metric with isotropic mean Berwald curvature are Berwald metrics. 相似文献
6.
7.
8.
9.
10.
We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the vanishing of the partition function is affected by changes in the magnetic field: elementary examples suffice to see non-polynomially countable cases that become polynomially countable after a perturbation of the magnetic field. The same recursive formula for the Grothendieck classes, under edge-doubling operations, holds as in the case without magnetic field, but the closed formulae for specific examples like banana graphs differ in the presence of magnetic field. We give examples of computation of the Euler characteristic with compact support, for the set of real zeros, and find a similar exponential growth with the size of the graph. This can be viewed as a measure of topological and algorithmic complexity. We also consider the computational complexity question for evaluations of the polynomial, and show both tractable and NP-hard examples, using dynamic programming. 相似文献